메뉴 건너뛰기




Volumn , Issue , 2011, Pages 261-266

Extracting and visualising tree-like structures from concept lattices

Author keywords

Concept Lattices; Formal Concept Analysis; Tree Extraction

Indexed keywords

CONCEPT LATTICES; CONCEPTUAL STRUCTURES; DATA SETS; DISTORTION TECHNIQUES; DOMAIN EXPERTS; FORMAL CONCEPT ANALYSIS; TREE EXTRACTION; TREE-LIKE STRUCTURES; VISUAL ANALYSIS; VISUALIZATION TECHNIQUE;

EID: 80053006912     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2011.46     Document Type: Conference Paper
Times cited : (21)

References (20)
  • 1
    • 34547711715 scopus 로고
    • Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity
    • Kuznetsov, S.O.: 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 (1990) 21-29
    • (1990) Nauchn. Tekh. Inf., Ser.2 (Automat. Document. Math. Linguist.) , vol.12 , pp. 21-29
    • Kuznetsov, S.O.1
  • 2
    • 0024108464 scopus 로고
    • Algorithms for plane representation of acyclic digraphs
    • Di Battista, G.; Tamassia, R. (1988), "Algorithms for plane representation of acyclic digraphs", Theoretical Computer Science 61: 175-178.
    • (1988) Theoretical Computer Science , vol.61 , pp. 175-178
    • Di Battista, G.1    Tamassia, R.2
  • 5
    • 41549130764 scopus 로고    scopus 로고
    • An intelligent user interface for browsing and searching MPEG-7 images using concept lattices
    • S. Ben Yahiaet al. (Eds. LNAI 4923 Springer-Verlag Berlin Heidelberg
    • Ducrou, J., Eklund, P., and Wilson, T. An Intelligent User Interface for Browsing and Searching MPEG-7 Images Using Concept Lattices. In S. Ben Yahiaet al. (Eds.): CLA 2006, LNAI 4923, pp. 1-21, Springer-Verlag Berlin Heidelberg 2008.
    • (2008) CLA 2006 , pp. 1-21
    • Ducrou, J.1    Eklund, P.2    Wilson, T.3
  • 6
    • 17044438212 scopus 로고    scopus 로고
    • Efficient algorithms for mining closed itemsets and their lattice structure
    • IEE Computer Soc.
    • Zaki, M.J., Hsiao, C-J. Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. In IEEE Transactions on Knowledge and Data Mining, Vol. 17, No. 4, IEE Computer Soc., 2005.
    • (2005) IEEE Transactions on Knowledge and Data Mining , vol.17 , Issue.4
    • Zaki, M.J.1    Hsiao, C.-J.2
  • 10
    • 0027621809 scopus 로고
    • Hy+: A hygraph-based query and visualization system
    • Consens, M., and Mendelzon, A. Hy+: a Hygraph-based query and visualization system. SIGMOD Record, 22(2):511-516, 1993.
    • (1993) SIGMOD Record , vol.22 , Issue.2 , pp. 511-516
    • Consens, M.1    Mendelzon, A.2
  • 12
    • 78650374363 scopus 로고    scopus 로고
    • A survey of hybrid representations of concept lattices in conceptual knowledge processing formal concept analysis
    • Springer Berlin/Heidelberg
    • Eklund, Peter, Villerd, Jean. A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing Formal Concept Analysis. Lecture Notes in Computer Science 2010, Springer Berlin/Heidelberg, pp. 296-311
    • (2010) Lecture Notes in Computer Science , pp. 296-311
    • Eklund, P.1    Villerd, J.2
  • 16
    • 84875287724 scopus 로고    scopus 로고
    • A space-optimized tree visualization
    • INFOVIS 2002 2002
    • Quang Vinh Nguyen; Mao Lin Huang. A space-optimized tree visualization, Information Visualization, 2002. INFOVIS 2002, pp. 85-92, 2002
    • (2002) Information Visualization , pp. 85-92
    • Nguyen, Q.V.1    Huang, M.L.2
  • 17
    • 85032279305 scopus 로고
    • Tree maps: A space-filling approach to visualization of hierarchical information structures
    • B. Johnson, B. Shneiderman: Tree maps: A Space-Filling Approach to Visualization of Hierarchical Information Structures. IEEE Visualization 1991: 284-291
    • (1991) IEEE Visualization , pp. 284-291
    • Johnson, B.1    Shneiderman, B.2
  • 19
    • 33745558225 scopus 로고    scopus 로고
    • Spring-based lattice drawing highlighting conceptual similarity
    • ICFCA Berlin. LNCS Springer, Heidelberg (2006)
    • Hannan, T., Pogel, A.: Spring-based lattice drawing highlighting conceptual similarity. In: Proceedings of the International Conference on Formal Concept Analysis, ICFCA 2006, Berlin. LNCS, vol. 3974, pp. 264-279. Springer, Heidelberg (2006)
    • (2006) Proceedings of the International Conference on Formal Concept Analysis , vol.3974 , pp. 264-279
    • Hannan, T.1    Pogel, A.2
  • 20
    • 84976831429 scopus 로고
    • A distributed algorithm for minimum-weight spanning trees
    • Jan. 1983
    • Gallager, R.G., Humblet, P.A., and Spira, P.M. 1983. A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. Program. Lang. Syst. 5, 1 (Jan. 1983), 66-77.
    • (1983) ACM Trans. Program. Lang. Syst. , vol.5 , Issue.1 , pp. 66-77
    • Gallager, R.G.1    Humblet, P.A.2    Spira, P.M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.