메뉴 건너뛰기




Volumn 4203 LNAI, Issue , 2006, Pages 47-57

Visualizing transactional data with multiple clusterings for knowledge discovery

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHARACTER SETS; KNOWLEDGE ACQUISITION;

EID: 33750309041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11875604_7     Document Type: Conference Paper
Times cited : (3)

References (20)
  • 2
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large database
    • May Washington DC, USA.
    • R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Database. ACM SIGMOD, 22(2):207-216, May 1993. Washington DC, USA.
    • (1993) ACM SIGMOD , vol.22 , Issue.2 , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 3
    • 0003878763 scopus 로고
    • North Holland, Amsterdam
    • C. Berge. Hypergraph. North Holland, Amsterdam, 1989.
    • (1989) Hypergraph
    • Berge, C.1
  • 6
    • 0035789293 scopus 로고    scopus 로고
    • Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction
    • San Francisco, California, USA, August
    • I. V. Cadez, P. Smyth, and H. Mannila. Probabilistic Modeling of Transaction Data with Applications to Profiling, Visualization, and Prediction. In Proc. 7th Int. Conf. on Knowledge Discovery and Data Mining (KDD'01), pages 37-46, San Francisco, California, USA, August 2001.
    • (2001) Proc. 7th Int. Conf. on Knowledge Discovery and Data Mining (KDD'01) , pp. 37-46
    • Cadez, I.V.1    Smyth, P.2    Mannila, H.3
  • 7
    • 0003488008 scopus 로고    scopus 로고
    • S. K. Card, J.D. Makinlay, and B. Shneiderman, editors. Morgan Kaufmann, San Francisco
    • S. K. Card, J.D. Makinlay, and B. Shneiderman, editors. Readings in Information Visualization. Morgan Kaufmann, San Francisco, 1999.
    • (1999) Readings in Information Visualization
  • 9
    • 0000251093 scopus 로고
    • Identifying the minimal transversals of a hypergraph and related problems
    • T. Eiter and G. Gottlob. Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM Journal on Computing Archive, 24(6):1278-1304, 1995.
    • (1995) SIAM Journal on Computing Archive , vol.24 , Issue.6 , pp. 1278-1304
    • Eiter, T.1    Gottlob, G.2
  • 10
    • 0012834533 scopus 로고    scopus 로고
    • Why so many clustering algorithms - A position paper
    • June
    • V. Estivill-Castro. Why So Many Clustering Algorithms - A Position Paper. ACM SIGKDD Explorations, 4(1):65-75, June 2002.
    • (2002) ACM SIGKDD Explorations , vol.4 , Issue.1 , pp. 65-75
    • Estivill-Castro, V.1
  • 15
    • 0002784345 scopus 로고    scopus 로고
    • Algorithms for association rule mining - A general survey and comparison
    • J. Hipp, H. Güntzer, and G. Nakhaeizadeh. Algorithms for Association Rule Mining - A General Survey and Comparison. SIGKDD Explorations, 2(1):58-64, 2000.
    • (2000) SIGKDD Explorations , vol.2 , Issue.1 , pp. 58-64
    • Hipp, J.1    Güntzer, H.2    Nakhaeizadeh, G.3


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