Robust Ensemble Clustering Using Probability Trajectories


Although many successful ensemble clustering approaches are developed in recent years, there are still two limitations to most of the present approaches. 1st, they mostly overlook the issue of unsure links, that could mislead the consensus method. Second, they typically lack the power to include international information to refine the local links. To deal with these 2 limitations, in this paper, we propose a unique ensemble clustering approach based on sparse graph illustration and chance trajectory analysis. In particular, we gift the elite neighbor choice strategy to spot the uncertain links by domestically adaptive thresholds and build a sparse graph with a little range of in all probability reliable links. We argue that a tiny range of in all probability reliable links will cause significantly higher consensus results than using all graph links no matter their reliability. The random walk process driven by a brand new transition likelihood matrix is utilized to explore the world info within the graph. We derive a unique and dense similarity measure from the sparse graph by analyzing the likelihood trajectories of the random walkers, based mostly on which two consensus functions are additional proposed. Experimental results on multiple real-world datasets demonstrate the effectiveness and efficiency of our approach.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Accurate and Robust Video Saliency Detection via Self-Paced Diffusion ABSTRACT: In order to estimate video saliency in the short term, traditional video saliency detection algorithms usually follow the common
PROJECT TITLE : Robust Lane Detection from Continuous Driving ScenesUsing Deep Neural Networks ABSTRACT: For autonomous vehicles and sophisticated driver assistance systems, lane recognition in driving scenes is a critical element.
PROJECT TITLE : Robust Unsupervised Multi-view Feature Learning with Dynamic Graph ABSTRACT: By modeling the affinity associations with a graph to lower the dimension, graph-based multi-view feature learning algorithms learn a
PROJECT TITLE : A Spatially Constrained Probabilistic Model for Robust Image Segmentation ABSTRACT: In probabilistic model based segmentation, the hidden Markov random field (HMRF) is used to describe the class label distribution
PROJECT TITLE : An Adaptive and Robust Edge Detection Method Based on Edge Proportion Statistics ABSTRACT: One of the most important preprocessing steps for high-level tasks in the field of image analysis and computer vision is

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry