scholarly journals Deep Multi-View Concept Learning

2018 ◽  
Author(s):  
Cai Xu ◽  
Ziyu Guan ◽  
Wei Zhao ◽  
Yunfei Niu ◽  
Quan Wang ◽  
...  
Keyword(s):  
Concept Learning ◽  
Real World ◽  
Representation Learning ◽  
Factorization Method ◽  
Block Coordinate Descent ◽  
Complementary Information ◽  
Abstraction Level ◽  
Coordinate Descent Algorithm ◽  
Factorization Model ◽  
Real World Datasets

Multi-view data is common in real-world datasets, where different views describe distinct perspectives. To better summarize the consistent and complementary information in multi-view data, researchers have proposed various multi-view representation learning algorithms, typically based on factorization models. However, most previous methods were focused on shallow factorization models which cannot capture the complex hierarchical information. Although a deep multi-view factorization model has been proposed recently, it fails to explicitly discern consistent and complementary information in multi-view data and does not consider conceptual labels. In this work we present a semi-supervised deep multi-view factorization method, named Deep Multi-view Concept Learning (DMCL). DMCL performs nonnegative factorization of the data hierarchically, and tries to capture semantic structures and explicitly model consistent and complementary information in multi-view data at the highest abstraction level. We develop a block coordinate descent algorithm for DMCL. Experiments conducted on image and document datasets show that DMCL performs well and outperforms baseline methods.

scholarly journals A Deep Non-negative Matrix Factorization Model for Big Data Representation Learning

2021 ◽  
Vol 15 ◽  
Author(s):  
Zhikui Chen ◽  
Shan Jin ◽  
Runze Liu ◽  
Jianing Zhang
Keyword(s):  
Big Data ◽  
Matrix Factorization ◽  
Pattern Mining ◽  
Representation Learning ◽  
Factorization Method ◽  
Data Representation ◽  
Deep Architecture ◽  
Factorization Model ◽  
Symmetric Loss ◽  
Benchmark Datasets

Nowadays, deep representations have been attracting much attention owing to the great performance in various tasks. However, the interpretability of deep representations poses a vast challenge on real-world applications. To alleviate the challenge, a deep matrix factorization method with non-negative constraints is proposed to learn deep part-based representations of interpretability for big data in this paper. Specifically, a deep architecture with a supervisor network suppressing noise in data and a student network learning deep representations of interpretability is designed, which is an end-to-end framework for pattern mining. Furthermore, to train the deep matrix factorization architecture, an interpretability loss is defined, including a symmetric loss, an apposition loss, and a non-negative constraint loss, which can ensure the knowledge transfer from the supervisor network to the student network, enhancing the robustness of deep representations. Finally, extensive experimental results on two benchmark datasets demonstrate the superiority of the deep matrix factorization method.

scholarly journals Multi-Aspect Embedding for Attribute-Aware Trajectories

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1149
Author(s):  
Thapana Boonchoo ◽  
Xiang Ao ◽  
Qing He
Keyword(s):  
Real World ◽  
Execution Time ◽  
State Of The Art ◽  
Representation Learning ◽  
Learning Approach ◽  
Trajectory Data ◽  
Trajectory Mining ◽  
Trajectory Similarity ◽  
Effectiveness And Efficiency ◽  
Real World Datasets

Motivated by the proliferation of trajectory data produced by advanced GPS-enabled devices, trajectory is gaining in complexity and beginning to embroil additional attributes beyond simply the coordinates. As a consequence, this creates the potential to define the similarity between two attribute-aware trajectories. However, most existing trajectory similarity approaches focus only on location based proximities and fail to capture the semantic similarities encompassed by these additional asymmetric attributes (aspects) of trajectories. In this paper, we propose multi-aspect embedding for attribute-aware trajectories (MAEAT), a representation learning approach for trajectories that simultaneously models the similarities according to their multiple aspects. MAEAT is built upon a sentence embedding algorithm and directly learns whole trajectory embedding via predicting the context aspect tokens when given a trajectory. Two kinds of token generation methods are proposed to extract multiple aspects from the raw trajectories, and a regularization is devised to control the importance among aspects. Extensive experiments on the benchmark and real-world datasets show the effectiveness and efficiency of the proposed MAEAT compared to the state-of-the-art and baseline methods. The results of MAEAT can well support representative downstream trajectory mining and management tasks, and the algorithm outperforms other compared methods in execution time by at least two orders of magnitude.

scholarly journals Discrete Embedding for Latent Networks

2020 ◽  
Author(s):  
Hong Yang ◽  
Ling Chen ◽  
Minglong Lei ◽  
Lingfeng Niu ◽  
Chuan Zhou ◽  
...  
Keyword(s):  
Real World ◽  
Representation Learning ◽  
Mixed Integer ◽  
Information Cascades ◽  
Integer Optimization ◽  
Network Embedding ◽  
Structure Information ◽  
Proximity Matrix ◽  
Real World Datasets ◽  
Embedding Methods

Discrete network embedding emerged recently as a new direction of network representation learning. Compared with traditional network embedding models, discrete network embedding aims to compress model size and accelerate model inference by learning a set of short binary codes for network vertices. However, existing discrete network embedding methods usually assume that the network structures (e.g., edge weights) are readily available. In real-world scenarios such as social networks, sometimes it is impossible to collect explicit network structure information and it usually needs to be inferred from implicit data such as information cascades in the networks. To address this issue, we present an end-to-end discrete network embedding model for latent networks DELN that can learn binary representations from underlying information cascades. The essential idea is to infer a latent Weisfeiler-Lehman proximity matrix that captures node dependence based on information cascades and then to factorize the latent Weisfiler-Lehman matrix under the binary node representation constraint. Since the learning problem is a mixed integer optimization problem, an efficient maximal likelihood estimation based cyclic coordinate descent (MLE-CCD) algorithm is used as the solution. Experiments on real-world datasets show that the proposed model outperforms the state-of-the-art network embedding methods.

scholarly journals Flexible Multi-View Representation Learning for Subspace Clustering

2019 ◽  
Author(s):  
Ruihuang Li ◽  
Changqing Zhang ◽  
Qinghua Hu ◽  
Pengfei Zhu ◽  
Zheng Wang
Keyword(s):  
Partial Information ◽  
Empirical Studies ◽  
Subspace Clustering ◽  
Representation Learning ◽  
Data Reconstruction ◽  
Clustering Methods ◽  
Complementary Information ◽  
Single View ◽  
Dependence Measure ◽  
Real World Datasets

In recent years, numerous multi-view subspace clustering methods have been proposed to exploit the complementary information from multiple views. Most of them perform data reconstruction within each single view, which makes the subspace representation unpromising and thus can not well identify the underlying relationships among data. In this paper, we propose to conduct subspace clustering based on Flexible Multi-view Representation (FMR) learning, which avoids using partial information for data reconstruction. The latent representation is flexibly constructed by enforcing it to be close to different views, which implicitly makes it more comprehensive and well-adapted to subspace clustering. With the introduction of kernel dependence measure, the latent representation can flexibly encode complementary information from different views and explore nonlinear, high-order correlations among these views. We employ the Alternating Direction Minimization (ADM) method to solve our problem. Empirical studies on real-world datasets show that our method achieves superior clustering performance over other state-of-the-art methods.

scholarly journals Bursting the Filter Bubble: Fairness-Aware Network Link Prediction

2020 ◽  
Vol 34 (01) ◽  
pp. 841-848
Author(s):  
Farzan Masrour ◽  
Tyler Wilson ◽  
Heng Yan ◽  
Pang-Ning Tan ◽  
Abdol Esfahanian
Keyword(s):  
Social Networking ◽  
Real World ◽  
Link Prediction ◽  
Representation Learning ◽  
Experimental Results ◽  
Adversarial Network ◽  
Network Link ◽  
Network Modularity ◽  
Filter Bubble ◽  
Real World Datasets

Link prediction is an important task in online social networking as it can be used to infer new or previously unknown relationships of a network. However, due to the homophily principle, current algorithms are susceptible to promoting links that may lead to increase segregation of the network—an effect known as filter bubble. In this study, we examine the filter bubble problem from the perspective of algorithm fairness and introduce a dyadic-level fairness criterion based on network modularity measure. We show how the criterion can be utilized as a postprocessing step to generate more heterogeneous links in order to overcome the filter bubble problem. In addition, we also present a novel framework that combines adversarial network representation learning with supervised link prediction to alleviate the filter bubble problem. Experimental results conducted on several real-world datasets showed the effectiveness of the proposed methods compared to other baseline approaches, which include conventional link prediction and fairness-aware methods for i.i.d data.

scholarly journals Trajectory Similarity Learning with Auxiliary Supervision and Optimal Matching

2020 ◽  
Author(s):  
Hanyuan Zhang ◽  
Xinyu Zhang ◽  
Qize Jiang ◽  
Baihua Zheng ◽  
Zhenbang Sun ◽  
...  
Keyword(s):  
Real World ◽  
Representation Learning ◽  
Similarity Learning ◽  
Trajectory Data ◽  
Optimal Matching ◽  
Training Samples ◽  
Trajectory Similarity ◽  
Similarity Computation ◽  
Real World Datasets ◽  
Relationship Of

Trajectory similarity computation is a core problem in the field of trajectory data queries. However, the high time complexity of calculating the trajectory similarity has always been a bottleneck in real-world applications. Learning-based methods can map trajectories into a uniform embedding space to calculate the similarity of two trajectories with embeddings in constant time. In this paper, we propose a novel trajectory representation learning framework Traj2SimVec that performs scalable and robust trajectory similarity computation. We use a simple and fast trajectory simplification and indexing approach to obtain triplet training samples efficiently. We make the framework more robust via taking full use of the sub-trajectory similarity information as auxiliary supervision. Furthermore, the framework supports the point matching query by modeling the optimal matching relationship of trajectory points under different distance metrics. The comprehensive experiments on real-world datasets demonstrate that our model substantially outperforms all existing approaches.

scholarly journals Learning Sequential Correlation for User Generated Textual Content Popularity Prediction

2018 ◽  
Author(s):  
Wen Wang ◽  
Wei Zhang ◽  
Jun Wang ◽  
Junchi Yan ◽  
Hongyuan Zha
Keyword(s):  
Real World ◽  
Information Overload ◽  
Representation Learning ◽  
Text Representation ◽  
Sequential Model ◽  
Content Popularity ◽  
Popularity Prediction ◽  
Real World Datasets ◽  
Textual Content ◽  
The Web

Popularity prediction of user generated textual content is critical for prioritizing information in the web, which alleviates heavy information overload for ordinary readers. Most previous studies model each content instance separately for prediction and thus overlook the sequential correlations between instances of a specific user. In this paper, we go deeper into this problem based on the two observations for each user, i.e., sequential content correlation and sequential popularity correlation. We propose a novel deep sequential model called User Memory-augmented recurrent Attention Network (UMAN). This model encodes the two correlations by updating external user memories which is further leveraged for target text representation learning and popularity prediction. The experimental results on several real-world datasets validate the benefits of considering these correlations and demonstrate UMAN achieves best performance among several strong competitors.

scholarly journals Stochastic Recursive Gradient Support Pursuit and Its Sparse Representation Applications

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4902
Author(s):  
Fanhua Shang ◽  
Bingkun Wei ◽  
Yuanyuan Liu ◽  
Hongying Liu ◽  
Shuang Wang ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Real World ◽  
Large Scale ◽  
Matching Pursuit ◽  
Linear Convergence ◽  
Representation Learning ◽  
Optimization Methods ◽  
Hard Thresholding ◽  
Real World Datasets ◽  
Norm Constraint

In recent years, a series of matching pursuit and hard thresholding algorithms have been proposed to solve the sparse representation problem with ℓ0-norm constraint. In addition, some stochastic hard thresholding methods were also proposed, such as stochastic gradient hard thresholding (SG-HT) and stochastic variance reduced gradient hard thresholding (SVRGHT). However, each iteration of all the algorithms requires one hard thresholding operation, which leads to a high per-iteration complexity and slow convergence, especially for high-dimensional problems. To address this issue, we propose a new stochastic recursive gradient support pursuit (SRGSP) algorithm, in which only one hard thresholding operation is required in each outer-iteration. Thus, SRGSP has a significantly lower computational complexity than existing methods such as SG-HT and SVRGHT. Moreover, we also provide the convergence analysis of SRGSP, which shows that SRGSP attains a linear convergence rate. Our experimental results on large-scale synthetic and real-world datasets verify that SRGSP outperforms state-of-the-art related methods for tackling various sparse representation problems. Moreover, we conduct many experiments on two real-world sparse representation applications such as image denoising and face recognition, and all the results also validate that our SRGSP algorithm obtains much better performance than other sparse representation learning optimization methods in terms of PSNR and recognition rates.

scholarly journals CuCo: Graph Representation with Curriculum Contrastive Learning

2021 ◽  
Author(s):  
Guanyi Chu ◽  
Xiao Wang ◽  
Chuan Shi ◽  
Xunqiang Jiang
Keyword(s):  
Real World ◽  
Scoring Function ◽  
Representation Learning ◽  
Parameter Analysis ◽  
Graph Representation ◽  
Training Procedure ◽  
Graph Classification ◽  
Graph Augmentation ◽  
Real World Datasets ◽  
The Impact

Graph-level representation learning is to learn low-dimensional representation for the entire graph, which has shown a large impact on real-world applications. Recently, limited by expensive labeled data, contrastive learning based graph-level representation learning attracts considerable attention. However, these methods mainly focus on graph augmentation for positive samples, while the effect of negative samples is less explored. In this paper, we study the impact of negative samples on learning graph-level representations, and a novel curriculum contrastive learning framework for self-supervised graph-level representation, called CuCo, is proposed. Specifically, we introduce four graph augmentation techniques to obtain the positive and negative samples, and utilize graph neural networks to learn their representations. Then a scoring function is proposed to sort negative samples from easy to hard and a pacing function is to automatically select the negative samples in each training procedure. Extensive experiments on fifteen graph classification real-world datasets, as well as the parameter analysis, well demonstrate that our proposed CuCo yields truly encouraging results in terms of performance on classification and convergence.

scholarly journals Content-Enhanced Network Embedding for Academic Collaborator Recommendation

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jie Chen ◽  
Xin Wang ◽  
Shu Zhao ◽  
Yanping Zhang
Keyword(s):  
Network Structure ◽  
Real World ◽  
Representation Learning ◽  
Text Representation ◽  
Network Embedding ◽  
Academic Tasks ◽  
Semantic Relationships ◽  
Structure Text ◽  
Text Information ◽  
Real World Datasets

It is meaningful for a researcher to find some proper collaborators in complex academic tasks. Academic collaborator recommendation models are always based on the network embedding of academic collaborator networks. Most of them focus on the network structure, text information, and the combination of them. The latent semantic relationships exist according to the text information of nodes in the academic collaborator network. However, these relationships are often ignored, which implies the similarity of the researchers. How to capture the latent semantic relationships among researchers in the academic collaborator network is a challenge. In this paper, we propose a content-enhanced network embedding model for academic collaborator recommendation, namely, CNEacR. We build a content-enhanced academic collaborator network based on the weighted text representation of each researcher. The content-enhanced academic collaborator network contains intrinsic collaboration relationships and latent semantic relationships. Firstly, the weighted text representation of each researcher is obtained according to its text information. Secondly, a content-enhanced academic collaborator network is built via the similarity of the weighted text representation of researchers and intrinsic collaboration relationships. Thirdly, each researcher is represented as a latent vector using network representation learning. Finally, top- k similar researchers are recommended for each target researcher. Experiment results on the real-world datasets show that CNEacR achieves better performance than academic collaborator recommendation baselines.

Sign in / Sign up

Export Citation Format

Share Document