메뉴 건너뛰기




Volumn 2843, Issue , 2003, Pages 418-425

Creating abstract concepts for classification by finding top-N maximal weighted cliques

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY;

EID: 0242329348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39644-4_41     Document Type: Short Survey
Times cited : (5)

References (11)
  • 4
    • 84867638942 scopus 로고    scopus 로고
    • Some Criterions for Selecting the Best Data Abstractions
    • Progress in Discovery Science
    • M. Haraguchi and Y. Kudoh: Some Criterions for Selecting the Best Data Abstractions, Progress in Discovery Science, LNCS 2281, pp.156-167, 2001.
    • (2001) LNCS , vol.2281 , pp. 156-167
    • Haraguchi, M.1    Kudoh, Y.2
  • 6
    • 0003704318 scopus 로고    scopus 로고
    • Dept. of Information and Computer Science, Univ. of California
    • S. Hettich and S. D. Bay: The UCI KDD Archive, http://kdd.ics.uci.edu, Dept. of Information and Computer Science, Univ. of California, 1999.
    • (1999) The UCI KDD Archive
    • Hettich, S.1    Bay, S.D.2
  • 9
    • 35248844119 scopus 로고    scopus 로고
    • Clustering of Distributions in Summarizing Information
    • in Japanese
    • K. Takabatake: Clustering of Distributions in Summarizing Information Proc. of IBIS'01, pp.309-314, 2001 (in Japanese).
    • (2001) Proc. of IBIS'01 , pp. 309-314
    • Takabatake, K.1
  • 10
    • 0012888467 scopus 로고    scopus 로고
    • Algorithm for mining association rules for binary segmentations of huge categorical databases
    • Y. Morimoto: Algorithm for mining association rules for binary segmentations of huge categorical databases, Proc. of VLDB'98, pp.380-391, 1998.
    • (1998) Proc. of VLDB'98 , pp. 380-391
    • Morimoto, Y.1


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