Document clustering based on non-negative matrix factorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools), Second Edition
Document clustering using nonnegative matrix factorization
Information Processing and Management: an International Journal
Enhancing clustering blog documents by utilizing author/reader comments
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
PCA and SVD with nonnegative loadings
Pattern Recognition
Scenario Discovery Using Nonnegative Tensor Factorization
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Nonnegative shared subspace learning and its application to social media retrieval
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Undergraduate research in computer forensics
Proceedings of the 2011 Information Security Curriculum Development Conference
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Randomized Algorithms for Matrices and Data
Foundations and Trends® in Machine Learning
Regularized nonnegative shared subspace learning
Data Mining and Knowledge Discovery
A query based approach for mining evolving graphs
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
A graph-based topic extraction method enabling simple interactive customization
Proceedings of the 2013 ACM symposium on Document engineering
Topic modelling of clickthrough data in image search
Multimedia Tools and Applications
Subtractive clustering for seeding non-negative matrix factorizations
Information Sciences: an International Journal
Global convergence of modified multiplicative updates for nonnegative matrix factorization
Computational Optimization and Applications
| Hi-index | 0.00 |
In this study, we apply a non-negative matrix factorization approach for the extraction and detection of concepts or topics from electronic mail messages. For the publicly released Enron electronic mail collection, we encode sparse term-by-message matrices and use a low rank non-negative matrix factorization algorithm to preserve natural data non-negativity and avoid subtractive basis vector and encoding interactions present in techniques such as principal component analysis. Results in topic detection and message clustering are discussed in the context of published Enron business practices and activities, and benchmarks addressing the computational complexity of our approach are provided. The resulting basis vectors and matrix projections of this approach can be used to identify and monitor underlying semantic features (topics) and message clusters in a general or high-level way without the need to read individual electronic mail messages.