Can triconcepts become triclusters?

References

• Agrawal, R., T. Imielinski, and A. N. Swami. 1993. “Mining Association Rules between Sets of Items in Large Databases.” In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, edited by P. Buneman and S. Jajodia, 207–216. Washington, DC: ACM Press, May 26–28, 1993.
   Google Scholar
• Belohlávek , R. 2001 . Lattices of Fixed Points of Fuzzy Galois Connections . Mathematical Logic Quarterly , 47 ( 1 ) : 111 – 116 .
   Web of Science ®Google Scholar
• Belohlávek, R. 2011. “What is a Fuzzy Concept Lattice? II.” In RSFDGrC, Vol. 6743 of Lecture Notes in Computer Science, edited by S. O. Kuznetsov, D. Slezak, D. H. Hepting and B. Mirkin, 19–26. Berlin: Springer.
   Google Scholar
• Belohlavek, R., and V. Vychodil. 2009. Factor Analysis of Incidence Data via Novel Decomposition of Matrices. ICFCA ’09. Darmstadt: Springer-Verlag, 83–97.
   Google Scholar
• Belohlavek, R., and V. Vychodil. 2010. Factorizing Three-Way Binary Data with Triadic Formal Concepts. KES’10. Cardiff: Springer-Verlag, 471–480.
   Google Scholar
• Besson, J., C. Robardet, and J. F. Boulicaut. 2006. “Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery.” In Conceptual Structures: Inspiration and Application., Vol. 4068 of Lecture Notes in Computer Science, edited by H. Scharfe, P. Hitzler and P. Ohrstrom, 144–157. Berlin: Springer.
   Google Scholar
• Cerf, L., J. Besson, C. Robardet, and J. F. Boulicaut. 2008. “Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations.” SIAM: 37–48.
   Google Scholar
• Cerf , L. , Besson , J. , Robardet , C. and Boulicaut , J. F. 2009 . Closed Patterns Meet n-ary Relations . ACM Transactions on Knowledge Discovery from Data , 3 : 3:1 – 3:36 .
   Web of Science ®Google Scholar
• Cheng, D., R. Kannan, S. Vempala, and G. Wang. 2003. On a Recursive Spectral Algorithm for Clustering from Pairwise Similarities. Technical report MIT-LCS-TR-906, MIT LCS.
   Google Scholar
• Dhillon, I. S. 2001. Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning. KDD ’01. San Francisco, CA: ACM, 269–274.
   Google Scholar
• Ding, C. H. Q., X. He, H. Zha, M. Gu, and H. D. Simon. 2001. A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. ICDM ’01. Washington, DC: IEEE Computer Society, 107–114.
   Google Scholar
• Drineas, P., A. Frieze, R. Kannan, S. Vempala, and V. Vinay. 1999. “Clustering in large graphs and matrices. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (SODA ’99), edited by R. E. Tarjan and T. Warnow, 291–299. Philadelphia, PA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Fiedler , M. 1973 . Algebraic Connectivity of Graphs . Czechosloval Mathematical Journal , 23 ( 98 ) : 298 – 305 .
   Google Scholar
• Ganter, B., and S. O. Kuznetsov. 2008. “Scale Coarsening as Feature Selection.” In ICFCA, Vol. 4933 of Lecture Notes in Computer Science, edited by R. Medina and S. A. Obiedkov, 217–228. Berlin: Springer.
   Google Scholar
• Ganter, B., and R. Wille. 1999. Formal Concept Analysis: Mathematical Foundations. 1st ed. Secaucus, NJ: Springer-Verlag New York, Inc.
   Google Scholar
• Gao, B., et al. 2005. Consistent Bipartite Graph Co-partitioning for Star-Structured High-Order Heterogeneous Data Co-clustering. KDD ’05. Chicago, IL: ACM, 41–50.
   Google Scholar
• Gnatyshak, D., D. I. Ignatov, A. Semenov, and J. Poelmans. 2012. “Gaining Insight in Social Networks with Biclustering and Triclustering.” In BIR, Vol. 128 of Lecture Notes in Business Information Processing, edited by N. Aseeva, E. Babkin and O. Kozyrev, 162–171. Berlin: Springer.
   Google Scholar
• Golub, G., and C. van Loan. 1989. Matrix Computations. Baltimore, MD: The John Hopkins University Press.
   Google Scholar
• Hartigan , J. A. 1972 . Direct Clustering of a Data Matrix . Journal of the American Statistical Association , 67 ( 337 ) : 123 – 129 .
   Web of Science ®Google Scholar
• Ignatov, D., A. Kaminskaya, S. Kuznetsov, and R. Magizov. 2010. A Concept-Based Biclustering Algorithm (in Russian). Moscow: MAKS Press, 140–143.
   Google Scholar
• Ignatov, D. I., A. Y. Kaminskaya, A. A. Bezzubtseva, A. V. Konstantinov, and J. Poelmans. 2013. “FCA-Based Models and a Prototype Data Analysis System for Crowdsourcing Platforms.” In ICCS, Vol. 7735 of Lecture Notes in Computer Science, edited by H. D. Pfeiffer, D. I. Ignatov, J. Poelmans and N. Gadiraju, 173–192. Berlin: Springer.
   Google Scholar
• Ignatov, D. I., S. O. Kuznetsov, and J. Poelmans. 2012. “Concept-Based Biclustering for Internet Advertisement.” In ICDM Workshops IEEE Computer Society, edited by J. Vreeken, C. Ling, M. J. Zaki, A. Siebes, J. X. Yu, B. Goethals, G. I. Webb and X. Wu, 123–130.
   Google Scholar
• Jäschke, R., R. Hotho, A. Schmitz, C. Ganter, and B. Stumme. 2006. TRIAS-An Algorithm for Mining Iceberg Tri-Lattices. ICDM ’06. Washington, DC: IEEE Computer Society, 907–911.
   Google Scholar
• Jäschke, R., A. Hotho, C. Schmitz, and G. Stumme. 2007. “Analysis of the Publication Sharing Behaviour in BibSonomy.” In Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), Vol. 4604 of Lecture Notes in Artificial Intelligence, edited by U. Priss, S. Polovina and R. Hill, 283–295. Berlin: Springer-Verlag.
   Google Scholar
• Kannan , R. , Vempala , S. and Veta , A. 2004 . On Clusterings-Good, Bad and Spectral . Proceedings 41st Annual Symposium on Foundations of Computer Science , 51 ( 3 ) : 497 – 515 .
   Google Scholar
• Kaytoue, M., S. Kuznetsov, J. Macko, and A. Napoli. in press. “Biclustering Meets Triadic Concept Analysis.” Annals of Mathematics and Artificial Intelligence.
   Google Scholar
• Kaytoue , M. , Kuznetsov , S. O. , Napoli , A. and Duplessis , S. 2011 . Mining Gene Expression Data with Pattern Structures in Formal Concept Analysis . Information Science , 181 ( 10 ) : 1989 – 2001 .
   Web of Science ®Google Scholar
• Klimushkin, M., S. Obiedkov, and C. Roth. 2010. “Approaches to the Selection of Relevant Concepts in the Case of Noisy Data.” In Formal Concept Analysis., Vol. 5986 of Lecture Notes in Computer Science, edited by L. Kwuida and B. Sertkaya, 255–266. Berlin: Springer.
   Google Scholar
• Kuznetsov , S. O. 1990 . Stability as an Estimate of the Degree of Substantiation of Hypotheses Derived on the Basis of Operational Similarity . Nauchn Tekh Inform Series 2 (Automatic Documentation and Mathematical Linguistics) , 12 : 21 – 29 .
   Google Scholar
• Kuznetsov , S. O. 2007 . On Stability of a Formal Concept . Annals of Mathematics and Artificial Intelligence , 49 ( 1–4 ) : 101 – 115 .
   Web of Science ®Google Scholar
• Kuznetsov , S. 1989 . Interpretation on Graphs and Complexity Characteristics of a Search for Specific Patterns . Nauchno-Tekhnicheskaya Informatsiya, Seriya 2 , 23 ( 1 ) : 23 – 27 .
   Google Scholar
• Kuznetsov , S. 1996 . Mathematical Aspects of Concept Analysis . Journal of Mathematical Science , 80 ( 2 ) : 1654 – 1698 .
   Google Scholar
• Lehmann , F. and Wille , R. 1995 . A Triadic Approach to Formal Concept Analysis , London : Springer-Verlag .
   Google Scholar
• Lingras , P. and Peters , G. 2011 . Rough Clustering . Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery , 1 ( 1 ) : 64 – 72 .
   Web of Science ®Google Scholar
• Liu , K. , Fang , B. and Zhang , W. 2010 . Unsupervised Tag Sense Disambiguation in Folksonomies . JCP , 5 ( 11 ) : 1715 – 1722 .
   Google Scholar
• Madeira , S. C. and Oliveira , A. L. 2004 . Biclustering Algorithms for Biological Data Analysis: A Survey . IEEE/ACM Transactions on Computational Biology and Bioinformatics , 1 ( 1 ) : 24 – 45 .
   PubMed Web of Science ®Google Scholar
• Miettinen, P. 2011. “Boolean Tensor Factorization.” In ICDM 2011, 11th IEEE International Conference on Data Mining, edited by D. Cook, J. Pei, W. Wang, O. Zaïane and X. Wu, 447–456. Vancouver: CPS.
   Google Scholar
• Mirkin, B. 1996. Mathematical Classification and Clustering. Dordrecht: Kluwer Academic Press.
   Google Scholar
• Mirkin, B. 2005. Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science). London: Chapman & Hall/CRC.
   Google Scholar
• Mirkin, B. G., and A. V. Kramarenko. 2011. Approximate Bicluster and Tricluster Boxes in the Analysis of Binary Data. RSFDGrC’11. Moscow: Springer-Verlag, 248–256.
   Google Scholar
• Nanopoulos, A., H. H. Gabriel, and M. Spiliopoulou. 2009. “Spectral Clustering in Social-Tagging Systems.” In WISE, Vol. 5802 of Lecture Notes in Computer Science, edited by G. Vossen, D. D. E. Long and J. X. Yu, 87–100. Berlin: Springer.
   Google Scholar
• Newman , M. E. J. 2005 . Power Laws, Pareto Distributions and Zipf’s Law . Contemporary Physics , 46 ( 5 ) : 323 – 351 .
   Web of Science ®Google Scholar
• Ng, A. Y., M. I. Jordan, and Y. Weiss. 2001. On Spectral Clustering: Analysis and an Algorithm. Cambridge, MA: MIT Press, 849–856.
   Google Scholar
• Pasquier , N. , Bastide , Y. , Taouil , R. and Lakhal , L. 1999 . Efficient Mining of Association Rules Using Closed Itemset Lattices . Information Systems , 24 ( 1 ) : 25 – 46 .
   Web of Science ®Google Scholar
• Pei, J., J. Han, and R. Mao. 2000. “CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets.” 21–30.
   Google Scholar
• Poelmans , J. , Elzinga , P. , Ignatov , D. I. and Kuznetsov , S. O. 2012 . Semi-Automated Knowledge Discovery: Identifying and Profiling Human Trafficking . International Journal of General Systems , 41 ( 8 ) : 774 – 804 .
   Web of Science ®Google Scholar
• Shi , J. and Malik , J. 2000 . Normalized Cuts and Image Segmentation . IEEE Transactions on Pattern Analysis and Machine Intelligence , 22 ( 8 ) : 888 – 905 .
   Web of Science ®Google Scholar
• Slezak, D., and A. Janusz. 2011. “Ensembles of Bireducts: Towards Robust Classification and Simple Representation.” In FGIT, Vol. 7105 of Lecture Notes in Computer Science, edited by T. H. Kim, H. Adeli, D. Slezak, F. E. Sandnes, X. Song, K. I. Chung and K. P. Arnett, 64–77. Berlin: Springer.
   Google Scholar
• Stumme , G. 2002 . Computing Iceberg Concept Lattices with Titanic . Data & Knowledge Engineering , 42 ( 2 ) : 189 – 222 .
   Web of Science ®Google Scholar
• Tsymbal , A. , Pechenizkiy , M. and Cunningham , P. 2005 . Diversity in Search Strategies for Ensemble Feature Selection . Information Fusion , 6 ( 1 ) : 83 – 98 .
   Google Scholar
• Vander Wal, T. 2007. “Folksonomy Coinage and Definition.” Accessed March 12, 2012. http://vanderwal.net/folksonomy.html
   Google Scholar
• Verma, D., and M. Meila. 2003. A Comparison of Spectral Clustering Algorithms. University of Washington Tech Rep UWCSE030501, 1 (03-05-01), 1–18.
   Google Scholar
• Voutsadakis , G. 2002 . Polyadic Concept Analysis . Order , 19 ( 3 ) : 295 – 304 .
   Google Scholar
• Wille , R. 1995 . The Basic Theorem of Triadic Concept Analysis . Order , 12 : 149 – 158 .
   Web of Science ®Google Scholar
• Zaki, M. J., and C. J. Hsiao. 2002. “CHARM: An Efficient Algorithm for Closed Itemset Mining.” In edited by R. L. Grossman, J. Han, V. Kumar, H. Mannila and R. Motwani. SDM SIAM.
   Google Scholar