{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:40:34Z","timestamp":1729626034713,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/icmlc.2011.6016966","type":"proceedings-article","created":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T16:16:22Z","timestamp":1316621782000},"page":"1449-1452","source":"Crossref","is-referenced-by-count":9,"title":["A new non-negative matrix factorization algorithm with sparseness constraints"],"prefix":"10.1109","author":[{"given":"Weizhong","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Huifang","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/1150402.1150420","article-title":"Orthogonal nonnegative matrix tri-factorizations for clustering","author":"ding","year":"2006","journal-title":"Proc of KDD"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390368"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.4.559"},{"key":"ref13","first-page":"58","article-title":"Impact of similarity measures on web-page clustering","author":"strehl","year":"2000","journal-title":"Proceedings of the Workshop on Artificial Intelligence for Web Search"},{"key":"ref14","first-page":"189","article-title":"Orthogonal Nonnegative Matrix Tri-factorization for Semi-supervised Document Co-clustering","author":"ma","year":"2010","journal-title":"Proc PAKDD 2010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1126\/science.287.5456.1273"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by nonnegative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0933-2","author":"allan","year":"2002","journal-title":"Topic Detection and Tracking Event-Based Information Organization"},{"key":"ref6","first-page":"1457","article-title":"Non-negative Matrix Factorization with Sparseness Constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2001.990477"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860485"},{"key":"ref7","article-title":"Non-negative matrix factorization for visual coding","author":"liu","year":"2003","journal-title":"Proc IEEE Int Conf on Acoustics Speech and Signal Processing"},{"journal-title":"Information Retrieval Data Structure and Algorithms","year":"1992","author":"frakers","key":"ref2"},{"journal-title":"Data Mining Concepts and Techniques","year":"2001","author":"han","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.67"}],"event":{"name":"2011 International Conference on Machine Learning and Cybernetics (ICMLC)","start":{"date-parts":[[2011,7,10]]},"location":"Guilin, China","end":{"date-parts":[[2011,7,13]]}},"container-title":["2011 International Conference on Machine Learning and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6009138\/6016945\/06016966.pdf?arnumber=6016966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T17:00:50Z","timestamp":1686330050000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6016966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icmlc.2011.6016966","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}