{"id":"https://openalex.org/W7171987419","doi":"https://doi.org/10.1145/3774521.3774526","title":"Smoothness-Preserving Deep Semi Non-negative Matrix Factorization for Clustering","display_name":"Smoothness-Preserving Deep Semi Non-negative Matrix Factorization for Clustering","publication_year":2025,"publication_date":"2025-12-17","ids":{"openalex":"https://openalex.org/W7171987419","doi":"https://doi.org/10.1145/3774521.3774526"},"language":null,"primary_location":{"id":"doi:10.1145/3774521.3774526","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3774521.3774526","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteen Indian Conference on Computer Vision, Graphics and Image Processing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3774521.3774526","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011421465","display_name":"Debapriya Roy","orcid":"https://orcid.org/0000-0001-8657-3130"},"institutions":[{"id":"https://openalex.org/I1288043984","display_name":"Techno India University","ror":"https://ror.org/00v1y6t69","country_code":"IN","type":"education","lineage":["https://openalex.org/I1288043984"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Debapriya Roy","raw_affiliation_strings":["Computer Science and Engineering, Techno Main Salt Lake, kolkata, West Bengal, India"],"raw_orcid":"https://orcid.org/0000-0001-8657-3130","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Techno Main Salt Lake, kolkata, West Bengal, India","institution_ids":["https://openalex.org/I1288043984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020310463","display_name":"Angshul Majumdar","orcid":"https://orcid.org/0000-0002-1065-3000"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Angshul Majumdar","raw_affiliation_strings":["Electronics and communication engineering, Indraprastha Institute of Information Technology Delhi, India, Delhi, India"],"raw_orcid":"https://orcid.org/0000-0002-1065-3000","affiliations":[{"raw_affiliation_string":"Electronics and communication engineering, Indraprastha Institute of Information Technology Delhi, India, Delhi, India","institution_ids":["https://openalex.org/I119939252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.7160999774932861},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6680999994277954},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6093999743461609},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.5938000082969666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5144000053405762},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.49959999322891235},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.48649999499320984},{"id":"https://openalex.org/keywords/feature-learning","display_name":"Feature learning","score":0.4596000015735626},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.42879998683929443},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.3625999987125397}],"concepts":[{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.7160999774932861},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6680999994277954},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6093999743461609},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5968000292778015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5950000286102295},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.5938000082969666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5144000053405762},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.49959999322891235},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.48649999499320984},{"id":"https://openalex.org/C59404180","wikidata":"https://www.wikidata.org/wiki/Q17013334","display_name":"Feature learning","level":2,"score":0.4596000015735626},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.32030001282691956},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3158000111579895},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.31139999628067017},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.30979999899864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30720001459121704},{"id":"https://openalex.org/C103275481","wikidata":"https://www.wikidata.org/wiki/Q6787889","display_name":"Matrix representation","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3046000003814697},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2989000082015991},{"id":"https://openalex.org/C116409475","wikidata":"https://www.wikidata.org/wiki/Q1385056","display_name":"External Data Representation","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.2896000146865845},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C144817290","wikidata":"https://www.wikidata.org/wiki/Q2976575","display_name":"Biclustering","level":5,"score":0.28630000352859497},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.28540000319480896},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.28220000863075256},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26649999618530273},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3774521.3774526","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3774521.3774526","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteen Indian Conference on Computer Vision, Graphics and Image Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3774521.3774526","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3774521.3774526","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteen Indian Conference on Computer Vision, Graphics and Image Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1491300635","https://openalex.org/W1890834058","https://openalex.org/W2129354191","https://openalex.org/W2730106296","https://openalex.org/W2883725317","https://openalex.org/W2953791858","https://openalex.org/W2963761396","https://openalex.org/W2964171990","https://openalex.org/W2995857167","https://openalex.org/W3004946360","https://openalex.org/W3087124270","https://openalex.org/W3185513611","https://openalex.org/W3188916965","https://openalex.org/W3201357114","https://openalex.org/W4205568156","https://openalex.org/W4221117657","https://openalex.org/W4283796586"],"related_works":[],"abstract_inverted_index":{"Clustering":[0],"is":[1,149,163,171],"a":[2,27,92,103,121,135,154,159,174],"fundamental":[3],"task":[4,177],"in":[5,45,102],"unsupervised":[6],"learning,":[7],"with":[8,200],"wide":[9],"ranging":[10],"applications":[11],"across":[12],"domains.":[13],"One":[14],"effective":[15],"approach":[16,129,196],"to":[17,79,82,152,165],"clustering":[18,203],"involves":[19],"modeling":[20,114],"the":[21,99,109,144,167,180,183,206],"relationships":[22],"between":[23],"data":[24,56,90],"samples":[25,33],"as":[26,173],"graph,":[28],"where":[29,178],"nodes":[30],"represent":[31],"individual":[32],"and":[34,49,85,115,182,205],"edges":[35],"encode":[36],"their":[37,80],"pairwise":[38],"similarity.":[39],"While":[40],"graph-based":[41,113],"methods":[42],"are":[43,185],"powerful":[44],"capturing":[46],"both":[47,179],"local":[48],"global":[50],"structures,":[51],"handling":[52],"complex":[53],"or":[54],"high-dimensional":[55],"often":[57],"requires":[58],"learning":[59],"more":[60],"meaningful":[61],"feature":[62,136],"representations.":[63,87],"Matrix":[64,68],"factorization":[65,126,142],"techniques\u2014particularly":[66],"Non-negative":[67],"Factorization":[69],"(NMF)":[70],"have":[71],"been":[72,198],"widely":[73],"used":[74,151],"for":[75,130],"this":[76,118,158,190],"purpose":[77],"due":[78],"ability":[81],"produce":[83],"disentangled":[84],"interpretable":[86],"By":[88],"decomposing":[89],"into":[91],"set":[93],"of":[94,112],"latent":[95],"factors,":[96],"NMF":[97],"reveals":[98],"underlying":[100],"structure":[101],"compact,":[104],"lower-dimensional":[105],"space.":[106],"Motivated":[107],"by":[108],"complementary":[110],"strengths":[111],"matrix":[116,125,141],"factorization,":[117],"work":[119],"introduces":[120],"novel":[122],"deep":[123,139],"semi-non-negative":[124],"(Deep":[127],"Semi-NMF)":[128],"clustering.":[131],"We":[132,188],"first":[133],"learn":[134,153],"representation":[137,148,181],"through":[138],"semi-negative":[140],"on":[143],"data.":[145,168],"This":[146],"learned":[147,186],"then":[150],"graph":[155,160,184],"Laplacian.":[156],"Following":[157],"cut":[161],"algorithm":[162],"employed":[164],"cluster":[166],"The":[169],"problem":[170,191],"formulated":[172],"joint":[175],"optimization":[176],"simultaneously.":[187],"solve":[189],"using":[192],"alternating":[193],"minimization.":[194],"Our":[195],"has":[197],"compared":[199],"several":[201],"state-of-the-art":[202],"techniques,":[204],"results":[207],"demonstrate":[208],"significant":[209],"improvements":[210],"over":[211],"existing":[212],"methods.":[213]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-08-01T00:00:00"}