메뉴 건너뛰기




Volumn 32, Issue 8, 1999, Pages 38-45

Mining very large databases

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; DATABASE SYSTEMS; DECISION TABLES; NEURAL NETWORKS; RANDOM ACCESS STORAGE; RESPONSE TIME (COMPUTER SYSTEMS); STATISTICAL METHODS; TREES (MATHEMATICS); WORLD WIDE WEB;

EID: 0032630575     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/2.781633     Document Type: Article
Times cited : (101)

References (20)
  • 2
    • 0001371923 scopus 로고    scopus 로고
    • Fast discovery of association rules
    • U.M. Fayyad et al., eds., AAAI/MIT Press, Menlo Park, Calif.
    • R. Agrawal et al., "Fast Discovery of Association Rules," Advances in Knowledge Discovery and Data Mining, U.M. Fayyad et al., eds., AAAI/MIT Press, Menlo Park, Calif., 1996, pp. 307-328.
    • (1996) Advances in Knowledge Discovery and Data Mining , pp. 307-328
    • Agrawal, R.1
  • 3
    • 0002082857 scopus 로고
    • An efficient algorithm for mining association rules in large databases
    • Morgan Kaufmann, San Francisco
    • A. Savasere, E. Omiecinski, and S. Navathe, "An Efficient Algorithm for Mining Association Rules in Large Databases," Proc. 21st Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1995, pp. 432-444.
    • (1995) Proc. 21st Int'l Conf. Very Large Data Bases , pp. 432-444
    • Savasere, A.1    Omiecinski, E.2    Navathe, S.3
  • 5
    • 0002663969 scopus 로고    scopus 로고
    • Sampling large databases for association rules
    • Morgan Kaufmann, San Francisco
    • H. Toivonen, "Sampling Large Databases for Association Rules," Proc. 22nd Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1996, pp. 134-145.
    • (1996) Proc. 22nd Int'l Conf. Very Large Data Bases , pp. 134-145
    • Toivonen, H.1
  • 6
    • 0031162961 scopus 로고    scopus 로고
    • Dynamic itemset counting and implication rules for market basket data
    • ACM Press, New York
    • S. Brin et al., "Dynamic Itemset Counting and Implication Rules for Market Basket Data, Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, New York, 1997, pp. 255-264.
    • (1997) Proc. ACM SIGMOD Int'l Conf. Management of Data , pp. 255-264
    • Brin, S.1
  • 7
    • 0029212693 scopus 로고
    • Mining sequential patterns
    • IEEE CS Press, Los Alamitos, Calif.
    • R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. 11th Int'l Conf. Data Eng., IEEE CS Press, Los Alamitos, Calif., 1995, pp. 3-14.
    • (1995) Proc. 11th Int'l Conf. Data Eng. , pp. 3-14
    • Agrawal, R.1    Srikant, R.2
  • 9
    • 0002034520 scopus 로고    scopus 로고
    • On the discovery of interesting patterns in association rules
    • Morgan Kaufmann, San Francisco
    • S. Ramaswamy, S. Mahajan, and A. Silbershatz, "On the Discovery of Interesting Patterns in Association Rules," Proc. 24th Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1998, pp. 368-379.
    • (1998) Proc. 24th Int'l Conf. Very Large Data Bases , pp. 368-379
    • Ramaswamy, S.1    Mahajan, S.2    Silbershatz, A.3
  • 11
    • 0032665257 scopus 로고    scopus 로고
    • Clustering large datasets in arbitrary metric spaces
    • IEEE CS Press, Los Alamitos, Calif.
    • V. Ganti et al., "Clustering Large Datasets in Arbitrary Metric Spaces," Proc. 15th Int'l Conf. Data Eng., IEEE CS Press, Los Alamitos, Calif., 1999, pp. 502-511.
    • (1999) Proc. 15th Int'l Conf. Data Eng. , pp. 502-511
    • Ganti, V.1
  • 13
    • 0003052357 scopus 로고    scopus 로고
    • WaveCluster: A multi-resolution clustering approach for very large spatial databases
    • Morgan Kaufmann, San Francisco
    • G. Sheikholeslami, S. Chatterjee, and A. Zhang, "WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases," Proc. 24th Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1998, pp. 428-439.
    • (1998) Proc. 24th Int'l Conf. Very Large Data Bases , pp. 428-439
    • Sheikholeslami, G.1    Chatterjee, S.2    Zhang, A.3
  • 14
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • Morgan Kaufmann, San Francisco
    • R.T. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1994, pp. 144-155.
    • (1994) Proc. 20th Int'l Conf. Very Large Data Bases , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 15
  • 16
    • 0000550189 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • AAAI Press, Menlo Park, Calif.
    • M. Ester et al., "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise," Proc. 2nd Int'l Conf. Knowledge Discovery Databases and Data Mining, AAAI Press, Menlo Park, Calif., 1996, pp. 226-231.
    • (1996) Proc. 2nd Int'l Conf. Knowledge Discovery Databases and Data Mining , pp. 226-231
    • Ester, M.1
  • 18
    • 0002139432 scopus 로고    scopus 로고
    • SPRINT: A scalable parallel classifier for data mining
    • Morgan Kaufmann, San Francisco
    • J. Shafer, R. Agrawal, and M. Mehta. "SPRINT: A Scalable Parallel Classifier for Data Mining," Proc. 22nd Int'l Conf. Very Large Data Bases," Morgan Kaufmann, San Francisco, 1996, pp. 544-555.
    • (1996) Proc. 22nd Int'l Conf. Very Large Data Bases , pp. 544-555
    • Shafer, J.1    Agrawal, R.2    Mehta, M.3
  • 19
    • 0000566535 scopus 로고    scopus 로고
    • Rainforest - A framework for fast decision tree construction of large datasets
    • Morgan Kaufmann, San Francisco
    • J. Gehrke, R. Ramakrishnan, and V. Ganti, "RainForest - a Framework for Fast Decision Tree Construction of Large Datasets," Proc. 24th Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1998, pp. 416-427.
    • (1998) Proc. 24th Int'l Conf. Very Large Data Bases , pp. 416-427
    • Gehrke, J.1    Ramakrishnan, R.2    Ganti, V.3
  • 20
    • 0002621626 scopus 로고    scopus 로고
    • Public: A decision tree classifier that integrates building and pruning
    • Morgan Kaufmann, San Francisco
    • R. Rastogi and K. Shim, "Public: A Decision Tree Classifier that Integrates Building and Pruning," Proc. 24th Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1998, pp. 404-415.
    • (1998) Proc. 24th Int'l Conf. Very Large Data Bases , pp. 404-415
    • Rastogi, R.1    Shim, K.2


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