{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:53:34Z","timestamp":1710251614436},"reference-count":28,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10,1]]},"abstract":"<p>Browsing concept lattices from Formal Concept Analysis (FCA) becomes a problem as the number of concepts can grow significantly with the number of objects and attributes. Interpreting the lattice through direct graph-based visualisation of the Hasse diagram rapidly becomes difficult and more synthetic representations are needed. In this work the authors propose an approach to simplify concept lattices by extracting and visualising trees derived from them. The authors further simplify the browse-able trees with two reduction methods: fault-tolerance and concept clustering.<\/p>","DOI":"10.4018\/ijiit.2013100102","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:44:00Z","timestamp":1395409440000},"page":"16-34","source":"Crossref","is-referenced-by-count":10,"title":["Browsing Large Concept Lattices through Tree Extraction and Reduction Methods"],"prefix":"10.4018","volume":"9","author":[{"given":"Cassio","family":"Melo","sequence":"first","affiliation":[{"name":"\u00c9cole Centrale Paris, Paris, France"}]},{"given":"B\u00e9n\u00e9dicte","family":"Le-Grand","sequence":"additional","affiliation":[{"name":"Centre de Recherche en Informatique, Universit\u00e9 Paris 1 Panth\u00e9on, Sorbonne, France"}]},{"given":"Marie-Aude","family":"Aufaure","sequence":"additional","affiliation":[{"name":"Mas Laboratory, \u00c9cole Centrale Paris, Paris, France"}]}],"member":"2432","reference":[{"key":"ijiit.2013100102-0","doi-asserted-by":"crossref","unstructured":"Andrews, S. (2011). In-close2, a high performance formal concept miner. In Proceedings of the, 19th International Conference on Conceptual Structures for Discovering Knowledge (ICCS\u201911) (pp. 50\u201362). Berlin, Heidelberg, Spain: Springer-Verlag.","DOI":"10.1007\/978-3-642-22688-5_4"},{"key":"ijiit.2013100102-1","unstructured":"Andrews, S., & Orphanides, C. (2010). Analysis of large data sets using formal concept lattices. In M. Kryszkiewicz & S. Obiedkov (Eds.), Proceedings of the 7th International Conference on Concept Lattices and Their Applications (pp. 104\u2013115). Seville, Spain: University of Seville."},{"key":"ijiit.2013100102-2","unstructured":"Blau, H., Immerman, N., & Jensen, D. (2002). A visual language for querying and updating graphs. University of Massachusetts Amherst, Computer Science Department Tech: Report."},{"key":"ijiit.2013100102-3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021571501451"},{"key":"ijiit.2013100102-4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058654"},{"key":"ijiit.2013100102-5","doi-asserted-by":"publisher","DOI":"10.1007\/11528784_9"},{"key":"ijiit.2013100102-6","doi-asserted-by":"publisher","DOI":"10.1145\/170036.171537"},{"key":"ijiit.2013100102-7","doi-asserted-by":"crossref","unstructured":"Cruz, I. F., Mendelzon, A. O., & Wood, P. T. (1987). A graphical query language supporting recursion. In Proc. of the Association for Computing Machinery Special Interest Group on Management of Data (pp. 323\u2013330). ACM Press.","DOI":"10.1145\/38714.38749"},{"key":"ijiit.2013100102-8","unstructured":"Ducrou, J., & Eklund, P. (2006, February 13-16). Browsing and searching MPEG-7 images using formal concept analysis. In Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications (pp. 317-322), Innsbruck, Austria."},{"key":"ijiit.2013100102-9","unstructured":"Eades, P. D. (1992). Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications, 5, 10\u201336."},{"key":"ijiit.2013100102-10","doi-asserted-by":"crossref","unstructured":"Eklund, P., & Villerd, J. (2010). A survey of hybrid representations of concept lattices in conceptual knowledge processing formal concept analysis (pp. 296-311). Lecture Notes in Computer Science, Springer Berlin\/Heidelberg.","DOI":"10.1007\/978-3-642-11928-6_21"},{"key":"ijiit.2013100102-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2"},{"key":"ijiit.2013100102-12","doi-asserted-by":"crossref","unstructured":"Hannan, T., & Pogel, A. (2006). Spring-based lattice drawing highlighting conceptual similarity. In Proceedings of the International Conference on Formal Concept Analysis, (ICFCA) (LNCS, vol. 3974, pp. 264\u2013279). Springer, Heidelberg.","DOI":"10.1007\/11671404_18"},{"key":"ijiit.2013100102-13","article-title":"Graph laplacians and their convergence on random neighborhood graphs.","author":"M.Hein","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"ijiit.2013100102-14","doi-asserted-by":"crossref","unstructured":"Johnson, B., & Shneiderman, B. (1991). Tree maps: A space-filling approach to visualization of hierarchical information structures. IEEE Visualization, 284-291.","DOI":"10.1109\/VISUAL.1991.175815"},{"key":"ijiit.2013100102-15","unstructured":"Kuznetsov, S. O. (1990). Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity. Nauchn. Tekh. Inf., Ser.2 (Automat. Document. Math. Linguist.), 12, 21\u201329."},{"key":"ijiit.2013100102-16","unstructured":"Le Grand, B., & Soto, M. (2001). Semantic web mining with XML topic maps. In Proceedings of XML, 2001 Conference, Orlando, FL."},{"key":"ijiit.2013100102-17","doi-asserted-by":"crossref","unstructured":"Le Grand, B., Soto, M., & Aufaure, M.-A. (2009). Conceptual and spatial footprints for complex systems analysis: Application to the semantic web. In Proceedings of the 20th International Conference on Database and Expert Systems Applications (pp. 114-127).","DOI":"10.1007\/978-3-642-03573-9_9"},{"key":"ijiit.2013100102-18","first-page":"85","author":"Q. V.Nguyen","year":"2002","journal-title":"A space-optimized tree visualization. Information Visualization"},{"key":"ijiit.2013100102-19","doi-asserted-by":"crossref","unstructured":"Pensa, R., & Boulicaut, J.-F. (2005). Towards fault-tolerant formal concept analysis. In Proc. 9th Congress of the Italian Association for Artificial Intelligence (pp. 212\u2013223). LNAI. Springer.","DOI":"10.1007\/11558590_22"},{"key":"ijiit.2013100102-20","doi-asserted-by":"crossref","unstructured":"Robertson, G., Mackinlay, J. D., & Card, S. (1991). Cone trees: Animated 3D visualizations of hierarchical information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference (pp. 189-194). Association for Computing Machinery.","DOI":"10.1145\/108844.108883"},{"key":"ijiit.2013100102-21","unstructured":"Roth, C., Obiedkov, S., & Kourie, D. G. (2006). Towards concise representation for taxonomies of epistemic communities. In Proceedings of the CLA 4th International Conference on Concept Lattices and their Applications."},{"key":"ijiit.2013100102-22","doi-asserted-by":"crossref","unstructured":"Soto, M., Le Grand, B., & Aufaure, M.-A. (2009). Spatial visualisation of conceptual data. In Proceedings of the International Conference Information Visualisation (pp. 57-61).","DOI":"10.1109\/IV.2009.10"},{"key":"ijiit.2013100102-23","doi-asserted-by":"publisher","DOI":"10.1006\/ijhc.2000.0420"},{"key":"ijiit.2013100102-24","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(02)00057-5"},{"key":"ijiit.2013100102-25","unstructured":"Trad, R. M., Le Grand, B., Aufaure, M.-A., & Soto, M. (2009). Conceptual and statistical footprints for social networks\u2019 characterization. In Proceedings of the International Workshop on Social Network Mining and Analysis \u2013 in conjunction with the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD, 2009)."},{"key":"ijiit.2013100102-26","unstructured":"Trad, R. M., Le Grand, B., Aufaure, M.-A., & Soto, M. (2010, March 15-18). PowerConcept: Conceptual metrics\u2019 distributed computation. In Proceedings of the 8th International Conference on Formal Concept Analysis (ICFCA), Agadir, Morroco."},{"key":"ijiit.2013100102-27","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500013"}],"container-title":["International Journal of Intelligent Information Technologies"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=103877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:50:41Z","timestamp":1654116641000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijiit.2013100102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijiit.2013100102","relation":{},"ISSN":["1548-3657","1548-3665"],"issn-type":[{"value":"1548-3657","type":"print"},{"value":"1548-3665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}