Multi-view Fuzzy Representation Learning with Rules based Model

Unsupervised multi-view representation learning has been extensively studied for mining multi-view data. However, some critical challenges remain. On the one hand, the existing methods cannot explore multi-view data comprehensively since they usually learn a common representation between views, given that multi-view data contains both the common information between views and the specific information within each view. On the other hand, to mine the nonlinear relationship between data, kernel or neural network methods are commonly used for multi-view representation learning. However, these methods are lacking in interpretability. To this end, this paper proposes a new multi-view fuzzy representation learning method based on the interpretable Takagi-Sugeno-Kang (TSK) fuzzy system (MVRL_FS). The method realizes multi-view representation learning from two aspects. First, multi-view data are transformed into a high-dimensional fuzzy feature space, while the common information between views and specific information of each view are explored simultaneously. Second, a new regularization method based on L_(2,1)-norm regression is proposed to mine the consistency information between views, while the geometric structure of the data is preserved through the Laplacian graph. Finally, extensive experiments on many benchmark multi-view datasets are conducted to validate the superiority of the proposed method.Comment: This work has been accepted by IEEE Transactions on Knowledge and Data Engineerin

Modern methods of analysis of economic indicators of the enterprise

The article highlights the importance of economic analysis of the financial and economic state of the enterprise in terms of applying modern methods of analysis from its various positions. The main focus is on methods and their methods of analysis of the financial state of enterprises. The main approaches to the interpretation of the essence of modern methods of analysis, their purpose and application in different spheres of analysis are investigated, their basic concepts and elements are revealed, their features, the purpose of the analysis and the results which can be obtained, their algorithms, models and stages of carrying out are determined. The characteristics of the main models that are used in the process of analyzing the financial condition of the enterprise are demonstrated. A consolidated comparative table of modern methods of analysis of economic indicators of the enterprise was created

Leveraging multi-dimensional, multi-source knowledge for user preference modeling and event summarization in social media

An unprecedented development of various kinds of social media platforms, such as Twitter, Facebook and Foursquare, has been witnessed in recent years. This huge amount of user generated data are multi-dimensional in nature. Some dimensions are explicitly observed such as user profiles, text of social media posts, time, and location information. Others can be implicit and need to be inferred, reflecting the inherent structures of social media data. Examples include popular topics discussed in Twitter or Facebook, or the geographical clusters based on user check-in activities from Foursquare. It is of great interest to both research communities and commercial organizations to understand such heterogeneous data and leverage available information from multiple dimensions to facilitate social media applications, such as user preference modeling and event summarization. This dissertation first presents a general discriminative learning approach for modeling multi-dimensional knowledge in a supervised setting. A learning protocol is established to model both explicit and implicit knowledge in a unified manner, which applies to general classification/prediction tasks. This approach accommodates heterogeneous data dimensions with a significant boosted expressiveness of existing discriminative learning approaches. It stands out with its capability to model latent features, for which arbitrary generative assumptions are allowed. Besides the multi-dimensional nature, social media data are unstructured, fragmented and noisy. It makes social media data mining even more challenging that a lot of real applications come with no available annotation in an unsupervised setting. This dissertation addresses this issue from a novel angle: external sources such as news media and knowledge bases are exploited to provide supervision. I describe a unified framework which links traditional news data to Twitter and enables effective knowledge discovery such as event detection and summarization

Game Theory-based Allocation Management in VCC Networks

Vehicular Ad-hoc Networks (VANETs) have contributed significantly towards improving road traffic management and safety. VANETs, integrated with Vehicular Clouds, enable underutilized vehicular resources for efficient resource management, fulfilling service requests. However, due to the frequently changing network topology of vehicular cloud networks, the vehicles frequently move out of the coverage area of roadside units (RSUs), disconnecting from the RSUs and interrupting the fulfillment of ongoing service requests. In addition, working with heterogeneous vehicles makes it difficult to match the service requests with the varying resources of individual vehicles. Therefore, to address these challenges, this work introduces the concept of clustering resources from nearby vehicles to form Combined Resource Units (CRUs). These units contribute to maximizing the rate of fulfillment of service requests. CRU composition is helpful, especially for the heterogeneity of vehicles, since it allows clustering the varying resources of vehicles into a single unit. The vehicle resources are clustered into CRUs based on three different sized pools, making the service matching process more time-efficient. Previous works have adopted stochastic models for resource clustering configurations. However, this work adopts distinct search algorithms for CRU composition, which are computationally less complex. Results showed that light-weight search algorithms, such as selective search algorithm (SSA), achieved close to 80% of resource availability without over-assembling CRUs in higher density scenarios. Following CRU composition, a game-theoretical approach is opted for allocating CRUs to service requests. Under this approach, the CRUs play a non-cooperative game to maximize their utility, contributing to factors such as fairness, efficiency, improved system performance and reduced system overhead. The utility value takes into account the RSS (Received Signal Strength) value of each CRU and the resources required in fulfilling a request. Results of the game model showed that the proposed approach of CRU composition obtained 90% success rate towards matching and fulfilling service requests