Behavior of the Concept Lattice Reduction to visualizing data after Using Matrix Decompositions
暂无分享,去创建一个
[1] Xia Lin,et al. Map Displays for Information Retrieval , 1997, J. Am. Soc. Inf. Sci..
[2] H. Sebastian Seung,et al. Algorithms for Non-negative Matrix Factorization , 2000, NIPS.
[3] Peter Bruza,et al. Query Reformulation on the Internet: Empirical Data and the Hyperindex Search Engine , 1997, RIAO.
[4] Michael W. Berry,et al. Text Mining Using Non-Negative Matrix Factorizations , 2004, SDM.
[5] Peter Bruza,et al. Interactive Internet search: keyword, directory and query reformulation mechanisms compared , 2000, SIGIR '00.
[6] Patrik O. Hoyer,et al. Non-negative sparse coding , 2002, Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing.
[7] C. Eckart,et al. The approximation of one matrix by another of lower rank , 1936 .
[8] Peter Bruza,et al. The Ranking of Query Refinements in Interactive Web-based Retrieval , 2000 .
[9] Claudio Carpineto,et al. A lattice conceptual clustering system and its application to browsing retrieval , 2004, Machine Learning.
[10] Claudio Carpineto,et al. ULYSSES: A Lattice-Based Multiple Interaction Strategy Retrieval Interface , 1995, EWHCI.
[11] Rudolf Wille,et al. Lattices in Data Analysis: How to Draw Them with a Computer , 1989 .