Scholarlink

<p>Subspace clustering (SC) is a hotspot in data analysis and machine learning. There exists much literature addressing this topic and most of which cannot handle large scale data. Although anchor graph learning is introduced to SC, there is still a problem that anchors cannot preserve the subspace structure of original data and spectral clustering process is still implemented slowly. To address these issues, an Anchor Graph Regularization based Large-Scale Stochastic Sparse Subspace Representation with Consensus Anchor Guidance (AGLS<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2025_6392_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="8" /> </InlineMediaObject> <EquationSource Format="TEX">\(^4\)</EquationSource> <EquationSource Format="MATHML"><math> <mmultiscripts> <mrow /> <mrow /> <mn>4</mn> </mmultiscripts> </math></EquationSource> </InlineEquation>RA) is proposed in this paper, which integrates three modules, including sparse self-representation, anchor graph regularization, and sparse coding into a unified framework. These modules are collaboratively worked to learn an optimal, high-quality anchor matrix under the row sparse constraint. Furthermore, the random sampling and label propagation techniques are also introduced to accelerate the clustering task. AGLS<InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2025_6392_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="8" /> </InlineMediaObject> <EquationSource Format="TEX">\(^4\)</EquationSource> <EquationSource Format="MATHML"><math> <mmultiscripts> <mrow /> <mrow /> <mn>4</mn> </mmultiscripts> </math></EquationSource> </InlineEquation>RA is capable of processing data in linear time, which is beneficial to the execution of large-scale tasks. A series of comparative experiments on benchmark datasets verify the effectiveness of the proposed method.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Large-scale stochastic sparse subspace representation with consensus anchor guidance

  • 期刊论文

  • 发表日期：

    2025年4月2日

查看全文
  • Ge Yang,
  • Tingquan Deng,
  • Ming Yang,
  • Changzhong Wang

摘要

Subspace clustering (SC) is a hotspot in data analysis and machine learning. There exists much literature addressing this topic and most of which cannot handle large scale data. Although anchor graph learning is introduced to SC, there is still a problem that anchors cannot preserve the subspace structure of original data and spectral clustering process is still implemented slowly. To address these issues, an Anchor Graph Regularization based Large-Scale Stochastic Sparse Subspace Representation with Consensus Anchor Guidance (AGLS \(^4\) 4 RA) is proposed in this paper, which integrates three modules, including sparse self-representation, anchor graph regularization, and sparse coding into a unified framework. These modules are collaboratively worked to learn an optimal, high-quality anchor matrix under the row sparse constraint. Furthermore, the random sampling and label propagation techniques are also introduced to accelerate the clustering task. AGLS \(^4\) 4 RA is capable of processing data in linear time, which is beneficial to the execution of large-scale tasks. A series of comparative experiments on benchmark datasets verify the effectiveness of the proposed method.