<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>14</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A ‎robust ‎‎unsupervised ‎‎feature ‎s‎election based on ‎‎subspace ‎l‎earning and ‎‎adaptive ‎‎graph ‎‎structure</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>207</FirstPage>
			<LastPage>230</LastPage>
			<ELocationID EIdType="pii">9129</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30225.2714</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hazhir</FirstName>
					<LastName>Sohrabi</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎University of Kurdistan‎, ‎Sanandaj‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Shahrokh</FirstName>
					<LastName>Esmaeili</LastName>
<Affiliation>Department of Applied Mathematics, University of Kurdistan, Sanandaj, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Parham</FirstName>
					<LastName>Moradi</LastName>
<Affiliation>School of Engineering‎, ‎RMIT University‎, ‎Melbourne‎, ‎Australia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>30</Day>
				</PubDate>
			</History>
		<Abstract>‎Feature selection is vital for improving high-dimensional data analysis by identifying a subset of representative ‎and‎ ‎uncorrelated features‎.&lt;br /&gt;‎This paper presents ‎an unsupervised feature selection ‎algorithm‎ based on subspace learning ‎and ‎adaptive ‎g‎raph ‎structure ‎(UFSAG‎)‎‎.&lt;br /&gt;‎The ‎UFSAG uses matrix factorization to preserve global data structure and incorporates local correlations into its objective function‎.&lt;br /&gt;‎It also integrates sample similarity graph learning to maintain data geometry‎.&lt;br /&gt;‎Unlike prior methods‎, ‎UFSAG employs adaptive local structure learning to reduce noise and enhance feature selection‎.&lt;br /&gt;‎By inducing row sparsity in the feature coefficient matrix using the $\ell_{2,1}$-norm‎, ‎UFSAG identifies representative features‎.&lt;br /&gt;‎Comparative experiments on six datasets show UFSAG&#039;s superior clustering performance over twelve state-of-the-art methods‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Matrix factorization‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎feature selection‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎local correlation‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎data manifold‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎clustering</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_9129_51aea41a776790ee69c0f270bd847808.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
