메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1441-1445

Optimal candidate generation in spatial co-location mining

Author keywords

Cliqueness; Co location mining; Spatial data mining

Indexed keywords

CANDIDATE GENERATION; CLIQUENESS; CO-LOCATED; COLOCATIONS; MINING ALGORITHMS; MINING PROCESS; SPATIAL DATA MINING; SPATIAL FEATURES;

EID: 72949111997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529604     Document Type: Conference Paper
Times cited : (7)

References (13)
  • 1
    • 0001882616 scopus 로고
    • Fast Algorithms for Mining Association Rules
    • Sep
    • Rakesh Agrawal and Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules. In Proc. of the 20th VLDB, pages 487-499, Sep 1995.
    • (1995) Proc. of the 20th VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 2
    • 0002130676 scopus 로고    scopus 로고
    • rey Scott Vitter. Scalable sweeping-based spatial join
    • Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, and Je.rey Scott Vitter. Scalable sweeping-based spatial join. In VLDB, pages 570-581, 1998.
    • (1998) VLDB , pp. 570-581
    • Arge, L.1    Procopiuc, O.2    Ramaswamy, S.3    Suel, T.4    Je5
  • 3
    • 0028202001 scopus 로고
    • An idea whose time has(h) passed?
    • Goetz Graefe. Sort-merge-join: An idea whose time has(h) passed? In ICDE, pages 406-417, 1994.
    • (1994) ICDE , pp. 406-417
    • Graefe, G.1    merge-join, S.2
  • 4
    • 33845237122 scopus 로고    scopus 로고
    • Yan Huang, Jian Pei, and Hui Xiong. Mining Co-Location Patterns with Rare Events from Spatial Data Sets. GeoInformatica, 10(3):239-260, Sep 2006.
    • Yan Huang, Jian Pei, and Hui Xiong. Mining Co-Location Patterns with Rare Events from Spatial Data Sets. GeoInformatica, 10(3):239-260, Sep 2006.
  • 6
    • 84957645397 scopus 로고
    • Discovery of spatial association rules in geographic information databases
    • Krzysztof Koperski and Jiawei Han. Discovery of spatial association rules in geographic information databases. In SSD, pages 47-66, 1995.
    • (1995) SSD , pp. 47-66
    • Koperski, K.1    Han, J.2
  • 7
    • 19544365404 scopus 로고    scopus 로고
    • GREW-A Scalable Frequent Subgraph Discovery Algorithm
    • Nov/Dec
    • Michihiro Kuramochi and George Karypis. GREW-A Scalable Frequent Subgraph Discovery Algorithm. In Proc. of the 4th IEEE ICDM, pages 439-442, Nov/Dec 2004.
    • (2004) Proc. of the 4th IEEE ICDM , pp. 439-442
    • Kuramochi, M.1    Karypis, G.2
  • 8
    • 0035790440 scopus 로고    scopus 로고
    • Mining Frequent Neighboring Class Sets in Spatial Databases
    • August
    • Yasuhiko Morimoto. Mining Frequent Neighboring Class Sets in Spatial Databases. In Proc. of the 7th ACM SIGKDD, pages 353-358, August 2001.
    • (2001) Proc. of the 7th ACM SIGKDD , pp. 353-358
    • Morimoto, Y.1
  • 9
    • 0030157411 scopus 로고    scopus 로고
    • Partition based spatial-merge join
    • Jignesh M. Patel and David J. DeWitt. Partition based spatial-merge join. In SIGMOD Conf., pages 259-270, 1996.
    • (1996) SIGMOD Conf , pp. 259-270
    • Patel, J.M.1    DeWitt, D.J.2
  • 12
    • 78149333073 scopus 로고    scopus 로고
    • Xifeng Yan and Jiawei Han. gSpan: Graph-Based Substructure Pattern Mining. In Proc. of 2002 IEEE ICDM, pages 721-724, Dec 2002.
    • Xifeng Yan and Jiawei Han. gSpan: Graph-Based Substructure Pattern Mining. In Proc. of 2002 IEEE ICDM, pages 721-724, Dec 2002.
  • 13
    • 33748365438 scopus 로고    scopus 로고
    • A Joinless Approach for Mining Spatial Colocation Patterns
    • Oct
    • Jin Soung Yoo and Shashi Shekhar. A Joinless Approach for Mining Spatial Colocation Patterns. IEEE TKDE, 18(10):1323-1337, Oct 2006.
    • (2006) IEEE TKDE , vol.18 , Issue.10 , pp. 1323-1337
    • Jin, S.1    Shekhar, S.2


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