On Concept Lattices and Implication Bases from Reduced Contexts
暂无分享,去创建一个
Václav Snásel | Zdenek Horak | Martin Polovincak | Hussam M. Dahwa Abdulla | Z. Horák | H. Abdulla | V. Snás̃el | M. Polovincak
[1] Peter W. Eklund,et al. Scalability in Formal Concept Analysis , 1999, Comput. Intell..
[2] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .
[3] H. Sebastian Seung,et al. Algorithms for Non-negative Matrix Factorization , 2000, NIPS.
[4] Rudolf Wille,et al. Lattices in Data Analysis: How to Draw Them with a Computer , 1989 .
[5] Michael W. Berry,et al. Document clustering using nonnegative matrix factorization , 2006, Inf. Process. Manag..
[6] Douglas R. Vogel,et al. Complexity Reduction in Lattice-Based Information Retrieval , 2005, Information Retrieval.
[7] Vincent Duquenne,et al. Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .
[8] Susan T. Dumais,et al. Computational Methods for Intelligent Information Access , 1995, Proceedings of the IEEE/ACM SC95 Conference.
[9] T. Landauer,et al. Indexing by Latent Semantic Analysis , 1990 .
[10] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.