메뉴 건너뛰기




Volumn 2118, Issue , 2001, Pages 91-102

Deriving high confidence rules from spatial data using Peano count trees

Author keywords

[No Author keywords available]

Indexed keywords

AGRICULTURAL ROBOTS; FORESTRY; GEOMETRY; INFORMATION MANAGEMENT;

EID: 84974688516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47714-4_9     Document Type: Conference Paper
Times cited : (18)

References (16)
  • 1
    • 0027621699 scopus 로고
    • Mining Association Rules Between Sets of Items in Large Database
    • R. Agrawal, T. Imielinski, A. Swami. Mining Association Rules Between Sets of Items in Large Database. ACM SIGMOD 1993
    • (1993) ACM SIGMOD
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 2
    • 0002221136 scopus 로고
    • Fast Algorithms for Mining Association Rules
    • R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. VLDB 1994
    • (1994) VLDB
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0030157416 scopus 로고    scopus 로고
    • Mining Quantitative Association Rules in Large Relational Tables
    • R. Srikant, R. Agrawal. Mining Quantitative Association Rules in Large Relational Tables. ACM SIGMOD 1996
    • (1996) ACM SIGMOD
    • Srikant, R.1    Agrawal, R.2
  • 4
    • 84976830511 scopus 로고
    • An effective Hash-Based Algorithm for Mining Association Rules
    • J. S. Park, M. Chen, P. S. Yu. An effective Hash-Based Algorithm for Mining Association Rules. ACM SIGMOD 1995
    • (1995) ACM SIGMOD
    • Park, J.S.1    Chen, M.2    Yu, P.S.3
  • 5
    • 0039253846 scopus 로고    scopus 로고
    • Mining Frequent Patterns without Candidate Generation
    • J. Han, J. Pei, Y. Yin. Mining Frequent Patterns without Candidate Generation. ACM SIGMOD 2000
    • (2000) ACM SIGMOD
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 6
    • 85172415673 scopus 로고    scopus 로고
    • Brute-Force Mining of High-Confidence Classification Rules
    • R. J. Bayardo. Brute-Force Mining of High-Confidence Classification Rules. KDD 1997
    • (1997) KDD
    • Bayardo, R.J.1
  • 7
    • 84974681367 scopus 로고    scopus 로고
    • Finding Interesting Associations without Support Pruning
    • E. Cohen, et al. Finding Interesting Associations without Support Pruning. VLDB 2000
    • (2000) VLDB
    • Cohen, E.1
  • 8
    • 0034592911 scopus 로고    scopus 로고
    • Growing Decision Trees on Support-less Association Rules
    • K. Wang, S. Zhou, Y. He. Growing Decision Trees on Support-less Association Rules. KDD 2000
    • (2000) KDD
    • Wang, K.1    Zhou, S.2    He, Y.3
  • 9
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional Access Methods
    • V. Gaede, O. Gunther. Multidimensional Access Methods. Computing Surveys, 30(2), 1998
    • (1998) Computing Surveys , vol.30 , Issue.2
    • Gaede, V.1    Gunther, O.2
  • 10
    • 0021644214 scopus 로고
    • The quadtree and related hierarchical data structure
    • H. Samet. The quadtree and related hierarchical data structure. ACM Computing Survey, 16, 2, 1984
    • (1984) ACM Computing Survey , vol.16
    • Samet, H.1
  • 13
    • 0016353777 scopus 로고
    • Quad trees: A data structure for retrieval of composite keys
    • R. A. Finkel, J. L. Bentley. Quad trees: A data structure for retrieval of composite keys. Acta Informatica, 4, 1, 1974
    • (1974) Acta Informatica , vol.4
    • Finkel, R.A.1    Bentley, J.L.2
  • 14
    • 84974681373 scopus 로고    scopus 로고
    • HH-code. Available at
    • HH-code. Available at http://www.statkart.no/nlhdb/iveher/hhtext.htm
  • 15
    • 84948104699 scopus 로고    scopus 로고
    • Integrating classification and association rule mining
    • B. Liu, W. Hsu, Y. Ma. Integrating classification and association rule mining. KDD 1998
    • (1998) KDD
    • Liu, B.1    Hsu, W.2    Ma, Y.3


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