scholarly journals Consensus Kernel K-Means Clustering for Incomplete Multiview Data

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Yongkai Ye ◽  
Xinwang Liu ◽  
Qiang Liu ◽  
Jianping Yin
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Clustering Algorithms ◽  
Multiple Views ◽  
Learning Method ◽  
Learning Framework ◽  
Optimal Integration ◽  
Art Methods ◽  
Multiview Clustering

Multiview clustering aims to improve clustering performance through optimal integration of information from multiple views. Though demonstrating promising performance in various applications, existing multiview clustering algorithms cannot effectively handle the view’s incompleteness. Recently, one pioneering work was proposed that handled this issue by integrating multiview clustering and imputation into a unified learning framework. While its framework is elegant, we observe that it overlooks the consistency between views, which leads to a reduction in the clustering performance. In order to address this issue, we propose a new unified learning method for incomplete multiview clustering, which simultaneously imputes the incomplete views and learns a consistent clustering result with explicit modeling of between-view consistency. More specifically, the similarity between each view’s clustering result and the consistent clustering result is measured. The consistency between views is then modeled using the sum of these similarities. Incomplete views are imputed to achieve an optimal clustering result in each view, while maintaining between-view consistency. Extensive comparisons with state-of-the-art methods on both synthetic and real-world incomplete multiview datasets validate the superiority of the proposed method.

scholarly journals Lifelong Spectral Clustering

2020 ◽  
Vol 34 (04) ◽  
pp. 5867-5874
Author(s):  
Gan Sun ◽  
Yang Cong ◽  
Qianqian Wang ◽  
Jun Li ◽  
Yun Fu
Keyword(s):  
Machine Learning ◽  
Real World ◽  
Spectral Clustering ◽  
State Of The Art ◽  
Clustering Algorithms ◽  
Orthogonal Basis ◽  
Learning Framework ◽  
The Past ◽  
Benchmark Datasets ◽  
Over Time

In the past decades, spectral clustering (SC) has become one of the most effective clustering algorithms. However, most previous studies focus on spectral clustering tasks with a fixed task set, which cannot incorporate with a new spectral clustering task without accessing to previously learned tasks. In this paper, we aim to explore the problem of spectral clustering in a lifelong machine learning framework, i.e., Lifelong Spectral Clustering (L2SC). Its goal is to efficiently learn a model for a new spectral clustering task by selectively transferring previously accumulated experience from knowledge library. Specifically, the knowledge library of L2SC contains two components: 1) orthogonal basis library: capturing latent cluster centers among the clusters in each pair of tasks; 2) feature embedding library: embedding the feature manifold information shared among multiple related tasks. As a new spectral clustering task arrives, L2SC firstly transfers knowledge from both basis library and feature library to obtain encoding matrix, and further redefines the library base over time to maximize performance across all the clustering tasks. Meanwhile, a general online update formulation is derived to alternatively update the basis library and feature library. Finally, the empirical experiments on several real-world benchmark datasets demonstrate that our L2SC model can effectively improve the clustering performance when comparing with other state-of-the-art spectral clustering algorithms.

scholarly journals Triple-GAIL: A Multi-Modal Imitation Learning Framework with Generative Adversarial Nets

2020 ◽  
Author(s):  
Cong Fei ◽  
Bin Wang ◽  
Yuzheng Zhuang ◽  
Zongzhang Zhang ◽  
Jianye Hao ◽  
...  
Keyword(s):  
Real World ◽  
Autonomous Vehicles ◽  
Data Augmentation ◽  
State Of The Art ◽  
Robot Learning ◽  
Imitation Learning ◽  
Proper Understanding ◽  
Learning Framework ◽  
Strategy Game ◽  
Real Time Strategy Game

Generative adversarial imitation learning (GAIL) has shown promising results by taking advantage of generative adversarial nets, especially in the field of robot learning. However, the requirement of isolated single modal demonstrations limits the scalability of the approach to real world scenarios such as autonomous vehicles' demand for a proper understanding of human drivers' behavior. In this paper, we propose a novel multi-modal GAIL framework, named Triple-GAIL, that is able to learn skill selection and imitation jointly from both expert demonstrations and continuously generated experiences with data augmentation purpose by introducing an auxiliary selector. We provide theoretical guarantees on the convergence to optima for both of the generator and the selector respectively. Experiments on real driver trajectories and real-time strategy game datasets demonstrate that Triple-GAIL can better fit multi-modal behaviors close to the demonstrators and outperforms state-of-the-art methods.

scholarly journals Revisiting and Optimising a CNN Colour Constancy Method for Multi-Illuminant Estimation

2021 ◽  
Vol 2021 (1) ◽  
pp. 68-72
Author(s):  
Ghalia Hemrit ◽  
Joseph Meehan
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Colour Constancy ◽  
Illuminant Estimation ◽  
Art Methods ◽  
Deep Cnn ◽  
Scene Illumination ◽  
Visual Results

The aim of colour constancy is to discount the effect of the scene illumination from the image colours and restore the colours of the objects as captured under a ‘white’ illuminant. For the majority of colour constancy methods, the first step is to estimate the scene illuminant colour. Generally, it is assumed that the illumination is uniform in the scene. However, real world scenes have multiple illuminants, like sunlight and spot lights all together in one scene. We present in this paper a simple yet very effective framework using a deep CNN-based method to estimate and use multiple illuminants for colour constancy. Our approach works well in both the multi and single illuminant cases. The output of the CNN method is a region-wise estimate map of the scene which is smoothed and divided out from the image to perform colour constancy. The method that we propose outperforms other recent and state of the art methods and has promising visual results.

scholarly journals Co-regularized weighting multiview clustering

2017 ◽  
Vol 11 (3) ◽  
pp. 217-223
Author(s):  
Cong-Zhe You ◽  
Xiao-Jun Wu
Keyword(s):  
Information Retrieval ◽  
Hot Spot ◽  
Clustering Algorithms ◽  
Experimental Results ◽  
Multiple Views ◽  
Variable Weighting ◽  
Multiview Clustering ◽  
The Individual ◽  
Clustering Patterns ◽  
Or Applications

This paper deals with clustering for multiview data. Multiview clustering has been a research hot spot in many domains or applications, such as information retrieval, biology, chemistry, and marketing. Exploring information from multiple views, one can hope to find a clustering that is more accurate than the ones obtained using the individual views. The aim is to search for clustering patterns that perform a consensus between the patterns from different views. Inspired by variable weighting and co-regularized strategy, this paper studies co-regularized weighting multiview clustering algorithms. Two co-regularized weighting multiview clustering algorithms are proposed from two aspects: pairwise co-regularization and centroid-based co-regularization. Experimental results obtained both on synthetic and real datasets show that the proposed algorithms outperform the main existing multiview clustering algorithms.

scholarly journals Unified Embedding Alignment with Missing Views Inferring for Incomplete Multi-View Clustering

2019 ◽  
Vol 33 ◽  
pp. 5393-5400 ◽  
Author(s):  
Jie Wen ◽  
Zheng Zhang ◽  
Yong Xu ◽  
Bob Zhang ◽  
Lunke Fei ◽  
...  
Keyword(s):  
Real World ◽  
Local Structure ◽  
Semantic Information ◽  
State Of The Art ◽  
Multiple Views ◽  
Learning Problem ◽  
Graph Regularization ◽  
Real World Applications ◽  
Weighting Strategy ◽  
The Common

Multi-view clustering aims to partition data collected from diverse sources based on the assumption that all views are complete. However, such prior assumption is hardly satisfied in many real-world applications, resulting in the incomplete multi-view learning problem. The existing attempts on this problem still have the following limitations: 1) the underlying semantic information of the missing views is commonly ignored; 2) The local structure of data is not well explored; 3) The importance of different views is not effectively evaluated. To address these issues, this paper proposes a Unified Embedding Alignment Framework (UEAF) for robust incomplete multi-view clustering. In particular, a locality-preserved reconstruction term is introduced to infer the missing views such that all views can be naturally aligned. A consensus graph is adaptively learned and embedded via the reverse graph regularization to guarantee the common local structure of multiple views and in turn can further align the incomplete views and inferred views. Moreover, an adaptive weighting strategy is designed to capture the importance of different views. Extensive experimental results show that the proposed method can significantly improve the clustering performance in comparison with some state-of-the-art methods.

scholarly journals A Mixed approach of Deep Learning method and Rule-Based method to improve Aspect Level Sentiment Analysis

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Paramita Ray ◽  
Amlan Chakrabarti
Keyword(s):  
Deep Learning ◽  
Sentiment Analysis ◽  
State Of The Art ◽  
The State ◽  
Learning Approach ◽  
Learning Method ◽  
Rule Based ◽  
Aspect Extraction ◽  
Art Methods ◽  
Rule Based Approach

Social networks have changed the communication patterns significantly. Information available from different social networking sites can be well utilized for the analysis of users opinion. Hence, the organizations would benefit through the development of a platform, which can analyze public sentiments in the social media about their products and services to provide a value addition in their business process. Over the last few years, deep learning is very popular in the areas of image classification, speech recognition, etc. However, research on the use of deep learning method in sentiment analysis is limited. It has been observed that in some cases the existing machine learning methods for sentiment analysis fail to extract some implicit aspects and might not be very useful. Therefore, we propose a deep learning approach for aspect extraction from text and analysis of users sentiment corresponding to the aspect. A seven layer deep convolutional neural network (CNN) is used to tag each aspect in the opinionated sentences. We have combined deep learning approach with a set of rule-based approach to improve the performance of aspect extraction method as well as sentiment scoring method. We have also tried to improve the existing rule-based approach of aspect extraction by aspect categorization with a predefined set of aspect categories using clustering method and compared our proposed method with some of the state-of-the-art methods. It has been observed that the overall accuracy of our proposed method is 0.87 while that of the other state-of-the-art methods like modified rule-based method and CNN are 0.75 and 0.80 respectively. The overall accuracy of our proposed method shows an increment of 7–12% from that of the state-of-the-art methods.

Weight-Discounted Symmetrization in Clustering Directed Graphs

2013 ◽  
Vol 756-759 ◽  
pp. 2979-2987 ◽  
Author(s):  
Bin He ◽  
Hui Liu ◽  
Xiang Hui Zhao ◽  
Ze Feng Li
Keyword(s):  
Directed Graph ◽  
Real World ◽  
State Of The Art ◽  
Directed Graphs ◽  
Clustering Algorithms ◽  
Similarity Measures ◽  
Citation Networks ◽  
Second Stage ◽  
Node Ranking ◽  
Link Similarity

An increasing attention has been recently devoted to uncovering community structure in directed graphs which widely exist in real-world complex networks such as social networks, citation networks, World Wide Web, email networks, etc. A two-stage framework for detecting clusters is an effective way for clustering directed graphs while the first stage is to symmetrize the directed graph using some similarity measures. Any state-of-the-art clustering algorithms for undirected graphs can be leveraged in the second stage. Hence, both stages are important to the effectiveness of the clustering result. However, existing symmetrization methods only consider about the direction of edges but ignore the weights of nodes. In this paper, we first attempt to connect link analysis in directed graph clustering. This connection not only takes into consideration the directionality of edges but also uses node ranking scores such as authority and hub score to explicitly capture in-link and out-link similarity. We also demonstrate the generality of our proposed method by showing that existing state-of-the-art symmetrization methods can be derived from our method. Empirical validation shows that our method can find communities effectively in real world networks.

scholarly journals Multi-View Collaborative Network Embedding

2021 ◽  
Vol 15 (3) ◽  
pp. 1-18
Author(s):  
Sezin Kircali Ata ◽  
Yuan Fang ◽  
Min Wu ◽  
Jiaqi Shi ◽  
Chee Keong Kwoh ◽  
...  
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Second Order ◽  
Collaborative Network ◽  
Multiple Views ◽  
Network Embedding ◽  
Single View ◽  
Video Sharing ◽  
Low Dimensional

Real-world networks often exist with multiple views, where each view describes one type of interaction among a common set of nodes. For example, on a video-sharing network, while two user nodes are linked, if they have common favorite videos in one view, then they can also be linked in another view if they share common subscribers. Unlike traditional single-view networks, multiple views maintain different semantics to complement each other. In this article, we propose M ulti-view coll A borative N etwork E mbedding (MANE), a multi-view network embedding approach to learn low-dimensional representations. Similar to existing studies, MANE hinges on diversity and collaboration—while diversity enables views to maintain their individual semantics, collaboration enables views to work together. However, we also discover a novel form of second-order collaboration that has not been explored previously, and further unify it into our framework to attain superior node representations. Furthermore, as each view often has varying importance w.r.t. different nodes, we propose MANE , an attention -based extension of MANE, to model node-wise view importance. Finally, we conduct comprehensive experiments on three public, real-world multi-view networks, and the results demonstrate that our models consistently outperform state-of-the-art approaches.

scholarly journals Active Learning with Multiple Views

2006 ◽  
Vol 27 ◽  
pp. 203-233 ◽  
Author(s):  
I. Muslea ◽  
S. Minton ◽  
C. A. Knoblock
Keyword(s):  
Active Learning ◽  
Real World ◽  
Multiple Views ◽  
Target Concept ◽  
Web Page ◽  
Web Page Classification ◽  
Wrapper Induction ◽  
Learning Framework ◽  
Page Classification

Active learners alleviate the burden of labeling large amounts of data by detecting and asking the user to label only the most informative examples in the domain. We focus here on active learning for multi-view domains, in which there are several disjoint subsets of features (views), each of which is sufficient to learn the target concept. In this paper we make several contributions. First, we introduce Co-Testing, which is the first approach to multi-view active learning. Second, we extend the multi-view learning framework by also exploiting weak views, which are adequate only for learning a concept that is more general/specific than the target concept. Finally, we empirically show that Co-Testing outperforms existing active learners on a variety of real world domains such as wrapper induction, Web page classification, advertisement removal, and discourse tree parsing.

scholarly journals Learning the Compositional Visual Coherence for Complementary Recommendations

2020 ◽  
Author(s):  
Zhi Li ◽  
Bo Wu ◽  
Qi Liu ◽  
Likang Wu ◽  
Hongke Zhao ◽  
...  
Keyword(s):  
Neural Network ◽  
Real World ◽  
Large Scale ◽  
State Of The Art ◽  
Optimization Strategy ◽  
Real World Data ◽  
World Data ◽  
Semantic Coherence ◽  
Global Coherence ◽  
Art Methods

Complementary recommendations, which aim at providing users product suggestions that are supplementary and compatible with their obtained items, have become a hot topic in both academia and industry in recent years. Existing work mainly focused on modeling the co-purchased relations between two items, but the compositional associations of item collections are largely unexplored. Actually, when a user chooses the complementary items for the purchased products, it is intuitive that she will consider the visual semantic coherence (such as color collocations, texture compatibilities) in addition to global impressions. Towards this end, in this paper, we propose a novel Content Attentive Neural Network (CANN) to model the comprehensive compositional coherence on both global contents and semantic contents. Specifically, we first propose a Global Coherence Learning (GCL) module based on multi-heads attention to model the global compositional coherence. Then, we generate the semantic-focal representations from different semantic regions and design a Focal Coherence Learning (FCL) module to learn the focal compositional coherence from different semantic-focal representations. Finally, we optimize the CANN in a novel compositional optimization strategy. Extensive experiments on the large-scale real-world data clearly demonstrate the effectiveness of CANN compared with several state-of-the-art methods.

Sign in / Sign up

Export Citation Format

Share Document