4.6 Article

Multiple Flat Projections for Cross-Manifold Clustering

Journal

IEEE TRANSACTIONS ON CYBERNETICS
Volume 52, Issue 8, Pages 7704-7718

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2021.3050487

Keywords

Manifolds; Clustering methods; Support vector machines; Periodic structures; Optimization; Indexes; Elongation; Clustering; cross-manifold clustering; flat-based clustering; manifold clustering; nonconvex programming

Funding

  1. National Natural Science Foundation of China [61966024, 61866010, 11871183, 61603338]
  2. Program for Young Talents of Science and Technology in Universities of Inner Mongolia Autonomous Region [NJYT-19-B01]
  3. Natural Science Foundation of Inner Mongolia Autonomous Region [2019BS01009, 2019MS06008]
  4. Scientific Research Foundation of Hainan University [kyqd(sk)1804]
  5. Hainan Provincial Natural Science Foundation of China [120RC449]
  6. Zhejiang Provincial Natural Science Foundation of China [LY21F030013]
  7. Fundamental Research Funds for the Central Universities, JLU

Ask authors/readers for more resources

Cross-manifold clustering is a challenging learning problem, and traditional clustering methods often fail in this scenario. The proposed multiple flat projections clustering (MFPC) effectively discovers global structures of implicit manifolds by projecting samples into localized flats and solving nonconvex matrix optimization problems through a recursive algorithm. The nonlinear version of MFPC, extended via kernel tricks, shows promising results in dealing with complex cross-manifold learning situations.
Cross-manifold clustering is an extreme challenge learning problem. Since the low-density hypothesis is not satisfied in cross-manifold problems, many traditional clustering methods failed to discover the cross-manifold structures. In this article, we propose multiple flat projections clustering (MFPC) for cross-manifold clustering. In our MFPC, the given samples are projected into multiple localized flats to discover the global structures of implicit manifolds. Thus, the intersected clusters are distinguished in various projection flats. In MFPC, a series of nonconvex matrix optimization problems is solved by a proposed recursive algorithm. Furthermore, a nonlinear version of MFPC is extended via kernel tricks to deal with a more complex cross-manifold learning situation. The synthetic tests show that our MFPC works on the cross-manifold structures well. Moreover, experimental results on the benchmark datasets and object tracking videos show excellent performance of our MFPC compared with some state-of-the-art manifold clustering methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available