{"id":"https://openalex.org/W2942653124","doi":"https://doi.org/10.1109/lsp.2019.2953638","title":"Restricted Connection Orthogonal Matching Pursuit for Sparse Subspace Clustering","display_name":"Restricted Connection Orthogonal Matching Pursuit for Sparse Subspace Clustering","publication_year":2019,"publication_date":"2019-11-15","ids":{"openalex":"https://openalex.org/W2942653124","doi":"https://doi.org/10.1109/lsp.2019.2953638","mag":"2942653124"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2019.2953638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2019.2953638","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1905.00420","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Wenqi Zhu","orcid":"https://orcid.org/0000-0001-9380-4363"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenqi Zhu","raw_affiliation_strings":["Communication and Information Security Lab, Shenzhen Graduate School, Peking University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0001-9380-4363","affiliations":[{"raw_affiliation_string":"Communication and Information Security Lab, Shenzhen Graduate School, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Shuai Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuai Yang","raw_affiliation_strings":["Communication and Information Security Lab, Shenzhen Graduate School, Peking University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Communication and Information Security Lab, Shenzhen Graduate School, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yuesheng Zhu","orcid":"https://orcid.org/0000-0003-2524-6800"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuesheng Zhu","raw_affiliation_strings":["Communication and Information Security Lab, Shenzhen Graduate School, Peking University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0003-2524-6800","affiliations":[{"raw_affiliation_string":"Communication and Information Security Lab, Shenzhen Graduate School, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4068,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64407073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"26","issue":"12","first_page":"1892","last_page":"1896"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.4650000035762787,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.4650000035762787,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.4000999927520752,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.026799999177455902,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8215000033378601},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.6722999811172485},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.6079999804496765},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.6010000109672546},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5842000246047974},{"id":"https://openalex.org/keywords/clustering-high-dimensional-data","display_name":"Clustering high-dimensional data","score":0.564300000667572},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.54830002784729},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5231000185012817},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.4372999966144562},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.43059998750686646}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8215000033378601},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.6722999811172485},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6079999804496765},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6010000109672546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5898000001907349},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5842000246047974},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.564300000667572},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.54830002784729},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5231000185012817},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5034999847412109},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.43059998750686646},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.39489999413490295},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.39340001344680786},{"id":"https://openalex.org/C44292817","wikidata":"https://www.wikidata.org/wiki/Q333871","display_name":"Orthogonal matrix","level":3,"score":0.3885999917984009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3628999888896942},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.3612000048160553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3537999987602234},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.32919999957084656},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32510000467300415},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C17137986","wikidata":"https://www.wikidata.org/wiki/Q215067","display_name":"Orthogonality","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C144817290","wikidata":"https://www.wikidata.org/wiki/Q2976575","display_name":"Biclustering","level":5,"score":0.2962000072002411},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C109659709","wikidata":"https://www.wikidata.org/wiki/Q3407504","display_name":"Affinity propagation","level":5,"score":0.2694999873638153},{"id":"https://openalex.org/C23822008","wikidata":"https://www.wikidata.org/wiki/Q5156437","display_name":"Complete-linkage clustering","level":5,"score":0.26669999957084656},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C185142706","wikidata":"https://www.wikidata.org/wiki/Q1134404","display_name":"Covariance matrix","level":2,"score":0.25870001316070557}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lsp.2019.2953638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2019.2953638","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1905.00420","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.00420","pdf_url":"https://arxiv.org/pdf/1905.00420","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1905.00420","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.00420","pdf_url":"https://arxiv.org/pdf/1905.00420","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320327511","display_name":"Development and Reform Commission of Shenzhen Municipality","ror":"https://ror.org/03jmg4515"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1600471557","https://openalex.org/W1977196460","https://openalex.org/W1993962865","https://openalex.org/W1997201895","https://openalex.org/W2003217181","https://openalex.org/W2004744336","https://openalex.org/W2054199929","https://openalex.org/W2123921160","https://openalex.org/W2127271355","https://openalex.org/W2129812935","https://openalex.org/W2132914434","https://openalex.org/W2139054653","https://openalex.org/W2142782401","https://openalex.org/W2152714163","https://openalex.org/W2165916500","https://openalex.org/W2227879930","https://openalex.org/W2532206188","https://openalex.org/W2563080677","https://openalex.org/W2747622561","https://openalex.org/W2766053647","https://openalex.org/W2884420828","https://openalex.org/W2888966461","https://openalex.org/W2892055442","https://openalex.org/W2901373116","https://openalex.org/W2962911132","https://openalex.org/W2963764968","https://openalex.org/W2963840432","https://openalex.org/W4250657332","https://openalex.org/W6675666693","https://openalex.org/W6742027703"],"related_works":[],"abstract_inverted_index":{"Sparse":[0,67],"Subspace":[1,68],"Clustering":[2,69],"(SSC)":[3],"is":[4,47],"one":[5],"of":[6,15,22,50,84,86,93,100],"the":[7,42,45,48,73,82,91],"most":[8],"popular":[9],"methods":[10,141],"for":[11,66,117],"clustering":[12,51,74,143],"a":[13,20,58,98],"group":[14],"data":[16,88,118,126],"points":[17],"lying":[18],"in":[19,142],"union":[21],"low-dimensional":[23],"subspaces.":[24],"However,":[25],"SSC":[26,39],"may":[27,40],"suffer":[28],"from":[29],"heavy":[30],"computational":[31],"burden.":[32],"Applying":[33],"Orthogonal":[34,63],"Matching":[35,64],"Pursuit":[36,65],"(OMP)":[37],"on":[38,124],"accelerate":[41],"computation":[43],"but":[44],"trade-off":[46],"loss":[49],"accuracy.":[52,144],"In":[53],"this":[54],"letter,":[55],"we":[56,96],"propose":[57],"noise-robust":[59],"algorithm,":[60],"Restricted":[61],"Connection":[62],"(RCOMP-SSC),":[70],"to":[71,103,113],"improve":[72],"accuracy":[75],"and":[76,122,127],"remain":[77],"computationally":[78],"efficient":[79],"by":[80],"restricting":[81],"number":[83],"connections":[85],"each":[87],"point":[89],"during":[90],"iteration":[92],"OMP.":[94],"Also,":[95],"develop":[97],"framework":[99],"control":[101,108],"matrix":[102,109],"realize":[104],"RCOMP-SSC.":[105],"The":[106],"proposed":[107],"can":[110],"be":[111],"applied":[112],"other":[114,140],"selection":[115],"strategies":[116],"point.":[119],"Our":[120],"analysis":[121],"experiments":[123],"synthetic":[125],"two":[128],"real-world":[129],"databases":[130],"(EYaleB":[131],"&":[132],"Usps)":[133],"have":[134],"demonstrated":[135],"that":[136],"our":[137],"algorithm":[138],"outperforms":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-05-09T00:00:00"}