Article

Free access

Scalable algorithms for mining large databases

Authors:

Rajeev Rastogi,

Kyuseok ShimAuthors Info & Claims

KDD '99: Tutorial notes of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining

Pages 73 - 140

https://doi.org/10.1145/312179.312187

Published: 01 August 1999 Publication History

PDF eReader

References

[1]

Rakesh Agr&wal, Tomasz Imlelinski, and Arun swami, Database mining: A performance perspective, IEEE Transactions on Knowledge and Data EngXneering, 5{6), December 1993.]]

Digital Library

Google Scholar

[2]

Rakesh Agrawal, Tomasz Imielinski, and Arun Swami, Mining association rules between sets of items in lar~ databases, the ACM $XGMOD Conference on Man&~ement o~ Data, ~ashington, D.C., ~a~ 1993.]]

Digital Library

Google Scholar

[3]

Rakesh AgrawaI, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo, Fast Discovery of Association Rules, Advances in Knowledge Discovery and Data Mining, 1996.]]

Digital Library

Google Scholar

[4]

Rakesh Agrawal and Ramakrishnan Srikant, Fast algorithms for mining association rules, the VLDB Conference, santiago, Chile, September 1994.]]

Digital Library

Google Scholar

[5]

Rakesh Agrawal and Ramakrishnan Srikant, Mining generalized association rules, the VLDB Conference, Zurich, Switzerland, September 1995.]]

Digital Library

Google Scholar

[6]

Rakesh Agrawal and Ramakrlshnan Srikant, Mining s~cluential patterns, Int'l Conference on Data E~gineer~ng, Taipei, Taiw~%, March 1995.]]

Digital Library

Google Scholar

[7]

Sergey Brin, Rajeev Motwani, and Craig Silverstein, Beyond market baskets: Generalizing association rules to correlations, the ACM SIGMOD Conference on Management of Data, Tucson, A~, June 1997.]]

Digital Library

Google Scholar

[8]

Sergey Brin, RajeevMotwani, Jeffrey D. Ullman, and Shalom Tsur, Dynamic itemset counting and implication rules for market basket data, the ACM SIGMOD Conference on Management of Data, Tucson, AZ, June 1997.]]

Digital Library

Google Scholar

[9]

Sergey Brin, Rajeev Rastogi, and Kyuseok Shim, Mining optimized gain rules ~or numeric attributes, the ACM SIGKDD Conference Knowledge Discovery and Data Mining, San Diego, CA, August 1999.]]

Digital Library

Google Scholar

[10]

G. Cooper and E. Herskovits, A Bayesian method for the induction of probabilistic networks from data, Machine Learning, 1992.]]

Digital Library

Google Scholar

[11]

D.W. Cheung, J. Han, V. Ng, A. W. Fu, and Y. Fu, A fast distribution algorithm for mining association rules, Int'l Conf. on Parallel and Distributed Information Systems, Miami Beach, Florida, December 1996.]]

Digital Library

Google Scholar

[12]

D.W. Cheung, J. Hart, V. Ng, and C. Y. Wong, Maintenance of discovered association rules in l~rge databases: An incremental updating techniqu~, Int'l Conference ~n Dat~En~ine~ring, New Orleans, Louisiana, Feburuary 1998]]

Digital Library

Google Scholar

[13]

Usama M. Fayyad, G. Piatetsky-Shaptro, l~aclhraic Smyth and Ra/nasamy Uthurusamy, editors, Advances in Knowledge ~f~covery and Data Mining, AAAI/MIT i~ress, Menlo Park, CA, 1996.]]

Digital Library

Google Scholar

[14]

Takeshi Fuku~, Yasuhiko Horimoto, Shinichi Horishita, and Takesh Tokuyama, Data mining using two-dime~siona2 optimized association rules. Scheme, algorithms, and visualization, the ACM SIGMOD Conference on l~arlag~t of Data, JuIle 1996.]]

Digital Library

Google Scholar

[15]

Takeshi Fukuda, Yasuhiko Horimoto, shinichi Horishita, and Takesh Tokuyama, Mining optimized association rules fo~ numeric attributes, the ACM SIGACT-SIGMOD-SIGART Sy~0osium on Prirlciples Database systems, June 1996.]]

Digital Library

Google Scholar

[16]

Jlawei Hart, Yanclong Cai, and Nick Cercohe, KI~owledge discovery in databases: An attribute oriented approach, the VLDB Conference}, Vancouver, British Columbia, Canada, 1992.]]

Digital Library

Google Scholar

[17]

J. Han and Y. Fu, Discove~y of multiple-level association rules from large databases, the VLDB Conference, Zurich, Switzerland, September 1995.]]

Digital Library

Google Scholar

[18]

Eui-Hong Nan, George Karypi$, and Vlpin Kumar, Scalable parallel data mining for association rules, the ACM SIGMOD Conference on ~ge~ne~t of Data, Tucson, AZ, June 1997.]]

Digital Library

Google Scholar

[19]

Maurice Houtsma and Arun swami, Set-oriented mining of association rules, Int'l Conference o~ Data Engineering, Taipei, Taiwan, March 1995.]]

Digital Library

Google Scholar

[20]

Minos N. Garofalakis, RaJeev Rastogi and Kyuseok Shim, SPIRIT: Sequeatial Pattern Mining with]]

Google Scholar

[21]

Regular Expression Constraints, the VLDB Conference, Edinburgh, Scotland, UK, 1999]]

Google Scholar

[22]

Flip Korn, Alexandros Labrinidis, Yannis Kotidis, and Christos Faloutsos, Ratio rules: A new paradigm for fast, quantifiable data mining, the VLDB Conference, New York City, New York, Sept either 1998.]]

Digital Library

Google Scholar

[23]

Brian Lent, Aru~ ~wami, and Jennifer Widom, C2usterfn~ association rules, Int'l Conference on Data Engineering, Brmingham, U.K., April 1997.]]

Digital Library

Google Scholar

[24]

Heikki Manila, Hannu Toivo~en and A, Inkeri Verkamo, Discovering frequent episodes in sequences, Int'l Conference on Knowledge Discovery in Databases and Data Mining (KDD-95}, Montreal, Canada, August 1995.]]

Google Scholar

[25]

Raymond T. NG, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang, Exploratory mining and pruning optimizations ~f constrained &ssociatfon rules, the ACM SIGMOD Conference on Management of Data, EeatCle, WA, Jtt~le 1998.]]

Digital Library

Google Scholar

[26]

B. Ozden, S. Ramaswamy, and A. Silberschatz, Cyclic association rules, Int'l Conference on Data Engineeri~lg, Orlando, 1998.]]

Digital Library

Google Scholar

[27]

Jong soo Park, Ming syan chela, and Philip S. Yu, An effective hash based algorith~ fo~ mining association r~les, the ACM-SXGMOD Conference on {~anagement of Data, San Jose, Califor~fa, May 1995.]]

Digital Library

Google Scholar

[28]

Jong $oo Park, Mtng Syan Chert, and Philip S. ~u, Efficien~ parallel mining for association rules, the 4=h Int'l confere~lce on Information and K~lowledge Management, Baltimore, MD, November 1995.]]

Google Scholar

[29]

sridhar Ramaswamy, Sameer Mahajan and Avi Silberschatz, On the discovery of interesting pattern~ in association rules, the VLDB Conference}. New York City, New York, September 1998.]]

Digital Library

Google Scholar

[30]

Rajeev Rastogi and Kyuseok Shim, Mining optimized association rule for categorical anti numeric attributes, Int'l Conference on Data Engineering, Orlando, Florida. Feburuary 1998.]]

Digital Library

Google Scholar

[31]

RaJeev ~asCogi and Kyuseok Shim, Mining optimized support rules for numeric attributes, Int'l Conference on Data Engineering, Sydney, Australia, March 1999.]]

Google Scholar

[32]

Ramakrishnan Srtkant and Rakesl~ AGrawal0 Mining generalized association rules, =he VLDB Conference, Zurich, Switzerland, Sept~ber 1995.]]

Digital Library

Google Scholar

[33]

Ramakrishnan Srikant and Rakesh Agrawal, Mining generalized association rules, the VLDB Conference, Zurich, Switzerlan~, September 1995.]]

Digital Library

Google Scholar

[34]

Ramakrishnan srika~t and Rakesh Agrawal, Mining quantitative association rules in large relational tables, the ACM ~IGMOD Conference on Manag=ment of Data, Jun~ 1996.]]

Digital Library

Google Scholar

[35]

Craig Silverstein, Sergey Brin, RaJeev Motwani, and Jeff Ullman, Scalable techniques for mining causal structures, the VLDB Conference, New York City, New York, September 1998.]]

Digital Library

Google Scholar

[36]

Takahiko Shintani and Masar~ Kitsuregawa, Parallel mining algorithms for generalized association rules with calssiflcation hierarchy, ~he ACM SZGMOD Conference on Management of Data, Seattle, WA, June 1998.]]

Digital Library

Google Scholar

[37]

A. Savas~re, E. Oraiecinski, and S. Navathe, An efficient algorithm for minil~g association rules in large databases, the VLDB Conference, Zurich, Switzerland, September 1995.]]

Digital Library

Google Scholar

[38]

Hannu Toivonen, sampling large databases for association rules, the VLDB Conference, Mumbat (Bombay), India, September 1996,]]

Digital Library

Google Scholar

[39]

Dick Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris ClifCon, Rajeev Motwani, $vetlozar Nestorov, and Arnon Rosenthal, Query flocks: A generalization of association-rule mining, the ACM SIG~0D Conference on Management of Data}, Seattle, WA, Juice 1998.]]

Digital Library

Google Scholar

[40]

rakesh Agrawal, Sakti Ghosh, Tomasz Imiellnskt, Bala Iyer, and Arun Swami, An interval classifier for database m/ning applications,P roe. VLDB conference, Vancouver, British Columbia, Canada, AUgl/St I992.]]

Digital Library

Google Scholar

[41]

Rakesh Agrawal, Tomasz Imtelinski, and Arun Swami, Database mining: A performance perspecClv, IEEETx~nsactions on Knowledg~ and Data E~gin~ring, 5(6), December 199~.]]

Digital Library

Google Scholar

[42]

L. Bretman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees, Wadsworth, Belmont, 1984.]]

Google Scholar

[43]

P. Cheeseman, James Kelly, Matthew Self, et al, AutoClass: A Bayesian classification system, the 5th Int'l Conf. on Machine Learning. Morgan Kaufman, June 1988.]]

Google Scholar

[44]

U. F&yy~d, On th~ Induction o~ Decision Trees for Multiple concept 5e~rning, PhD thesis, The university of Michigan, Ann arbor, 1991.]]

Digital Library

Google Scholar

[45]

USama FaYyad and Kekl B. Irani, Multi-interval discretizatton of continuous-valued attributes for classification learning, ~he 13th Int'l Joint Conference on Artificial Intelligence, 1993.]]

Google Scholar

[46]

Takeshi Fukuda, Yasuhiko Morimoto, and Shinichi Morishita, Constructing efficient decision trees by using optimized mumeric association rules, the VLDB Conference, Bombay, India, 1996.]]

Digital Library

Google Scholar

[47]

Johannes Gehrke, Venkatesh GanCi, Raghu Ramakrishnan, and Wei-Yin Loh, BOAT-Optimistic decision tre~ construction, the ACM SIG~4OD Con~er~nc~ onM~u%&gemQnt Of Dat~, Phil~d~lphi&, PA, J%H%e 1999.]]

Digital Library

Google Scholar

[48]

Johannes Gehrke, Raghu l%amakrishnan, and Venkatesh Ganti, Rainforest - a framework for fast decision tree classification of large da=asets, the VLDB Conference, New York City, New York, August 1998.]]

Digital Library

Google Scholar

[49]

D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Morgan Kau~mann, 1989.]]

Digital Library

Google Scholar

[50]

E, B. Hunt, J. Matin, and P. J. Stone, editors, Ibq~eriments in Induction, Academic Press, New York, 1966.]]

Google Scholar

[51]

R. Krichevsky and V. Trofimmv, The perfornlance of universal encoding, IEE~ Transactions on Infozlmatton Theory, 27(2), I981.]]

Google Scholar

[52]

Mantsh Mehta, Rakesh Agrawal, and Jorma Rissanen, SLIQ: A fast scalable classifier for data mining, EDBT 96, Avignon, France, l~arch 1996.]]

Digital Library

Google Scholar

[53]

Manisb Nehta, Jorma Rissanel~, a/gd Rakesh A~rawal, MDL-based decision tree pruning, In~'l Conference on Knowledge Discovery in Databases and Data Mining (KDD-95), Montreal, Canada, Au~st 1995.]]

Google Scholar

[54]

D. Mitchie, D. J. Spiegelhalter, and C. C. Taylor, Machine Learning, Neural and Statistical Classification, Ellis Morwood, 1994.]]

Digital Library

Google Scholar

[55]

J.R. Quinlan and R. L. Rivest0 Inferring decision trees using minimum description length principle, Information and Con~putation, 1989.]]

Digital Library

Google Scholar

[56]

J.R. Quinlan, Induction of decision trees, Machine Learning, 1, 1986.]]

Digital Library

Google Scholar

[57]

J.R. Quinlan, sin%olifying decision trees., Journal of Man-Machine Studies, 27, 1987.]]

Digital Library

Google Scholar

[58]

J. Ross QUinlan, c4.5: Programs for and Neural Networks, Cambridge University Press, Cambridge, 1996. Machine Learning, Morgan Kauf~an, 1993.]]

Google Scholar

[59]

Rajeev Rastogi and K)a/seok Shim, PUBLIC: A decision tree classifier that integrates building and pruning, the VLDB Conference, N~w York City, NY, 1998]]

Digital Library

Google Scholar

[60]

B.D. Rlpley, Pattern Recognition]]

Google Scholar

[61]

J. Rtssanen, Modeling by shortest data description, Automatics, 14, 1978.]]

Google Scholar

[62]

J. Rissanen, Stochastic Complexity in Statistical Inquiry, World Scientific Publ, Co., 1989.]]

Digital Library

Google Scholar

[63]

Joh~ Sharer, Rakesh Agrawai, and Manish Mehta, SPRINT: A scalable parallel classifier for data mining, the VLDB Conference, Bombay, India, September 1996.]]

Digital Library

Google Scholar

[64]

Charu C. Agrawal, Ceilia Procopiuc, Joel L. Wolf, Philip E. Yu, and Jong Soo Prk, Fast Algorithms for Projected Clustering, the ACM SIGMOD Conference on Management o~ Data, Philadelphia, PA, June 1999.]]

Digital Library

Google Scholar

[65]

Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan, Automatic Subspace C~uJ~gring 01'1 High Dimensional Da%a for Data Mining A~plications, thQ ACM EIGMOD Confmreneo on Management of Data, Seattle, Washington, June i99B.]]

Digital Library

Google Scholar

[66]

Mihael Ankerst, Marku~ M. Breunig, Ha~-Peter Kriegel, and Jorg SaI~der, OPTICS: Ordering points to ide/gtify the clustering structure, the AC~4 SIG~40D Conference on Management of Data, Philadelphia, PA, June 1999.]]

Digital Library

Google Scholar

[67]

N. Beckma/ln, H.-P. Krtegel, R. Schneider, and B. Seeger, The R*-Cree: an efficient and robust access method for points and rectangles, the ACM SIGMOD, Atlantic City, 1%3, May 1990.]]

Digital Library

Google Scholar

[68]

Richard O. Duds a~d Peter E. Hard, Pattern Classification and Scene AX~alysis, A Wiley- Interscience Publication, New York, 1973.]]

Google Scholar

[69]

Martin Ester, Hans-Peter Kriegel, Jorg Sander, Michael Wimmner, and Xiaowei Xu, Incremental Clustering fo~ Mining in a Data Warehousing Environment, the VLDB Conference, New York City, New York, August 1998.]]

Digital Library

Google Scholar

[70]

Martin Ester, Hans-Peter Kriegel, Jorg Sa~der, and Xiaowei XU, ~ity-Connected set~ and their Application for Trend Detection in SDatial Databases, Int'l Conference on Knowledge Discovery in Databases and Data Mining (KDD-97), Newport Beach, CA, August 1997.]]

Google Scholar

[71]

Martin Ester, F~ans-Peter Kriegel, Jorg Sander, and Xiaowei Xu, A density-based algorithm for discovering clusters in large spatial database with noise, Int' 1 conference on Knowledge Discovery in Databases and Data ~inil%g (KDD-96), Portland, Oregon, August 1996.]]

Google Scholar

[72]

Martin E~ter, Hans-Peter Kriegel, and Xiaowei Xu, A database interface for clusterinG in large spatial databases, Int' 1 Conference on Knowledge DisCovery in Databases and Data Mining (KDD- 95), Montreal, Canada, August 1995.]]

Google Scholar

[73]

Christos Faloutsos, King-Ip Lin, Fast_Map: A fast algorithm for Indexing, Data Mining and Visualization of Traditional and Multimedia Datasets, the AC~ SI~OD Conference on Mmnage~m~nt of Data, Sa/% Jose, CA, May 1995~]]

Digital Library

Google Scholar

[74]

Venkatesh Ganti, Raghu Ramakrishnam, and Johannes Gehrke, Clustering Large Datasets in Arbitrary Metric Spaces, the 15th International Conference on Data Engineering, Sydney, Australia, April 1999,]]

Digital Library

Google Scholar

[75]

David Gibson, Jon Kleinberg, and Prabhakar Raghavan, Clustering Categorical Data: An Approach Based on Dynamical Systems, the VLDB Conference, New York city, New York, August 1998.]]

Digital Library

Google Scholar

[76]

sudipto Guba, Rajeev Rastogi and Kyuseok shim, CURE: An Efficient Clustering Algorithm for ~arge Databases, the ACM SIGMOD Conference on Manage~nent of Data, Seattle, Washington, Ju~e 1998]]

Digital Library

Google Scholar

[77]

Sudipto Guha, Rajeev Rastogi and Kyuseok shim, ROCK: A Robust Clustering Algorithm for Categorical Attributes, the 15th International Conference on Data Engineering, Sydney, Australia, April 1999.]]

Digital Library

Google Scholar

[78]

Eui-Hong Han, George Karypis, Vipin Kumar, and Bamshad Mobasher, Clustering based on association rule hypergr~phs, the ACM SIGI40D Workshop o~ Res~rch Issues o~ Data Mining and Know{e~e Discovery, Montreal, Canada, June 1997.]]

Google Scholar

[79]

Anil K. Jain aria Rlchar~ C. Dubes, Algorithms for clustering Data, Pxentice Hall, Ex~glewooG Cliffs. New Jersey, 1988.]]

Digital Library

Google Scholar

[80]

Raymond T. Ng and Ji&wei Hart, Efficient and effective clustering methods for spatial data mining, the VLDB Conference, Santiago, Chile, September 1994.]]

Digital Library

Google Scholar

[81]

Gholamhosein sheikholeslami, Suroji: ChatterJee and Aidong Zhang, WaveCluster: A Multi- Resolution Clustering Approach for Very Large spatial Databases, the VLDB Conference, New York City, New York, August 1998]]

Digital Library

Google Scholar

[82]

Tian Zhang, Raghu Ramakrishnan, and Miron, Birch: An efficient data clustering method for very large databases, the ACM SIGMOD Conference on Management of Data, Montreal, Canada, June 1996.]]

Digital Library

Google Scholar

[83]

Rakesh Agrawal, Christos Faloutsos, and Arun swami, Efficient similarity search in sequence databases, the Fourth International Conference o~ Foundations of Data Organization and A1gorithnus, Chicago, October 1993.]]

Digital Library

Google Scholar

[84]

Rakesh Agrawal, King-Ip bin, Harpreet s. Sawhney, and Kyuseok Shim, Fast similarity search in the presence of noise, scaling, and translation in time series databases, the VLDB Conference, Zurich, Switzerland, Sept 1995.]]

Digital Library

Google Scholar

[85]

Rakesh Agrawal, Giuseppe Psaila, Edward b. WiDeners, and Mohamed Zait, Querying shapes of histories, the VLDB Conference, Zurich, Switzerland, Sept 1995.]]

Digital Library

Google Scholar

[86]

Rakesh Agrawal, Thomas Imielinski, and Arun Swami, Database mining: A performance perspective, IEEE Transactions on Knowledge and Data Engineering, 5(6), December 1993.]]

Digital Library

Google Scholar

[87]

D.J. Berndt and J. Clifford, Using dynamic time warping to find patterns in time series, KDD- 94: AAAI Workshop on Knowledge DiScovery in Databases, Seattle, Washington, July I994.]]

Google Scholar

[88]

Gautam Das, King-Ip Lin, HeikKi Mannila, Gopal Renganatha~ and Padhraic Smyth, Rule discovery ~rom time seri~s, Int'l Conference on Knowledg~ Discovery in Databases ~ncI Datm Mining {KDD-95), New York City, New York, August 1998.]]

Google Scholar

[89]

C. Faloutsos, M. Banganathan, and Y. Manolopoulos, Fast sobsE~Ta~nce matching in time-series databases, the AcM SIGMOD Conference on Management of Data, May 1994.]]

Digital Library

Google Scholar

[90]

D.Q. Goldin and P. C. Kanellakis, On similarity queries for time-series data: constraint specification and implementation, the 1st Int'l Conference on the Principles and Practice of Constraint Programming, ACM, 1984]]

Digital Library

Google Scholar

[91]

Joseph M. Hellerstein, Elias Koutsoupias, and Christos H. Papadimitriou, On the analysis of indexing schemes, the ACM PODS, Seattle, WA, May 1998.]]

Digital Library

Google Scholar

[92]

H.V. Jagadish, A. O. Mendelzon, and T. Milo, Similarity-based queries, the ACM PODS, 1995]]

Digital Library

Google Scholar

[93]

Davood Rafiei and Alberto Mendelzon, Slmilarity-Based Queries for Time Series Data, the ACM SIG~40D Conference, TUcson, AZ, May 1997.]]

Digital Library

Google Scholar

[94]

Kyuseok Shim, Ramakrishna~ Srikant and Rakesh A~jrawal, High-dimensional similarity joins, the 13th Intern~tional conference on IEEE Data Engineering, Birmimgham. UK, 1997]]

Digital Library

Google Scholar

[95]

Byoung-Kee Yi, H. V. Jagadish, and Christos Falutsos, Efficient Retrieval of Similar Time Sequences under Time Warping, the 14th Int'l Confer~nc~ on Data Engineering, OTlan~lo, FL, Feburary 1998,]]

Digital Library

Google Scholar

[96]

C. Faloutsos et al., Efficient and effective querying by image content, Journal of Intelligent Information Systems, ~:231--262, 1994.]]

Digital Library

Google Scholar

[97]

M. Flickner, H. Sawhn~y, W. Niblack, J. Ashley, B. Dora, Q. Htu~ng, M. Gorkani, J. Hafner, D. Lee D. Petkovic, D. Steele, and P. Yanker, Query by image and video content: the QBXC syste~, I~EE Co~uter, 28(9), 1995.]]

Digital Library

Google Scholar

[98]

Amar~ath Gupta and Ramesh Jain, Visual information rgtrieval, communications of the ACM, 40{5), 1997.]]

Digital Library

Google Scholar

[99]

b. J. Guibas, B. Rogoff, and C. To~asi, Fixed-window image descriptors for image retrieval, Storage and Retrieval for Image and Video Databases XII, volume 2420 of SPIE Proceeding Series, Feb. 199~.]]

Google Scholar

[100]

C. E. Jacobs, A. Finkelstein, and D. H. Salesin, Fast multiresolution image queryillg, SIGGRAPH 95, Annual Conference Series, August 1995.]]

Digital Library

Google Scholar

[101]

Apostol Natsev, Rajeev Rastogf and Kyuseok Shim, WALRUS: A similarity Retrieval Algorithm ~or Image Databases, the ACM SIGMOD Conference on Manager0~_nt of Data, Philadelphia, PA, June 1999]]

Digital Library

Google Scholar

[102]

W. Niblack et al., The QBIC project: Q~ery image by content using color, texture and shape, Storage ~und Retrieval for Image and Video Databases, San Jose, 1993. SPIE.]]

Google Scholar

[103]

Apostoi Natsev, RaJee~ Rastogi, and K~seok Shim, WALRUS. A similarity matching algori~hm for image databases, Technical report, Bell Laboratories, Murray Hill, 1998.]]

Google Scholar

[104]

R. W. Picard and T. Kabir, Finding similar patterns in large image databases, IEEE ICASSP, volume V, Minneapolis, 1993.]]

Crossref

Google Scholar

[105]

A. Pentland, R. W. Picard, and S. Sclaroff, Photobook- Content-based manipulation of image databases, SPIE Storage and RetrtevaI Image and Video Databases I, san Jose, I995.]]

Google Scholar

[106]

E. J. Stollnitz, T. D. DeRose, and D. H. Salesin, Wavelets for Computer Graphics: Theory and Applications, Morgan Kaufmann, 1996.]]

Digital Library

Google Scholar

[107]

J. R. Smith, Integrated Spatial and Feature Image Systems: Retrieval, Compression and Analysis, PhD thesis, Graduate School of Arts and Sciences, Columbia U~iversity, Feb. Z997.]]

Google Scholar

[108]

James Ze Wang, Gio Wlederhold, Oscar Firschein, and sha Xin Wei, Content-based image indexing and searching using Daubechies' wavelets. Intl. Journal of Digital Libraries (IJODL~, Z(4~, 199B.]]

Google Scholar

[109]

A. Arning, Rakesh Agrawal, and P. Raghavan, A linear method for deviation detection in large databases, ~nt'! Conference on Knowledge Discovery in Databases and Data Mining (KDD-95), Portland, Oregon, AUgust 1996.]]

Google Scholar

[110]

V. Barnett and T. Lewis, Outliers in Statistical Data, Joh~ Wiley and Sons, New York, I994.]]

Google Scholar

[111]

Edwin N. Knott and Raymond T. Ng, Algorithms for mining distance-based outliers in large datasets, the VLDB Conference, New York, USA, September Z994.]]

Google Scholar

[112]

Sridhar Ramaswamy, Rajeev Rastogi and Kyuseok shim, Efficient algorithms for mining outliers from large data sets, Technical report, Bell Laboratories, Murray Hill, 1998.]]

Google Scholar

[113]

I. Ruts and P. Rousseeuw, Computing depth contours of bivariate point clouds, Co~utational Statistics and Data Analysis, 23, 1996.]]

Digital Library

Google Scholar

[114]

S. Sarawagi, R. Agrawal, and N. Megiddo, Discovery-driven exploration o! olap data cubes, the Sixth In='1 Conference on Extending DaCabase Technology (EDBT), Valencia, Spain, March 1998.]]

Digital Library

Google Scholar

Cited By

View all

Ghosh JStrehl A(2005)Clustering and Visualization of Retail Market BasketsAdvanced Techniques in Knowledge Discovery and Data Mining10.1007/1-84628-183-0_3(75-102)Online publication date: 2005
https://doi.org/10.1007/1-84628-183-0_3
Strehl AGhosh J(2003)Relationship-Based Clustering and Visualization for High-Dimensional Data MiningINFORMS Journal on Computing10.1287/ijoc.15.2.208.1444815:2(208-230)Online publication date: 15-Apr-2003
https://dl.acm.org/doi/10.1287/ijoc.15.2.208.14448
Yan Yang Kamel M(2003)Clustering ensemble using swarm intelligenceProceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)10.1109/SIS.2003.1202249(65-71)Online publication date: 2003
https://doi.org/10.1109/SIS.2003.1202249
Show More Cited By

Index Terms

Scalable algorithms for mining large databases
1. Information systems
  1. Information systems applications
    1. Data mining

Recommendations

Efficient algorithms for mining high-utility itemsets in uncertain databases

High-utility itemset mining (HUIM) is a useful set of techniques for discovering patterns in transaction databases, which considers both quantity and profit of items. However, most algorithms for mining high-utility itemsets (HUIs) assume that the ...
Efficiently mining frequent itemsets from very large databases
Scalable mining of large disk-based graph databases
KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining

Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspaces effectively, but few of them address the mining on large, disk-based ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

KDD '99: Tutorial notes of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining

August 1999

291 pages

ISBN:1581131712

DOI:10.1145/312179

Editor:
Jiawei Han

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

KDD99

Sponsor:

KDD99: The First Annual International Conference on Knowledge Discovery in Data

August 15 - 18, 1999

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Sponsor:
sigkdd
sigkdd

The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 3 - 7, 2025

Toronto , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
2,137
Total Downloads

Downloads (Last 12 months)58
Downloads (Last 6 weeks)8

Reflects downloads up to 13 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ghosh JStrehl A(2005)Clustering and Visualization of Retail Market BasketsAdvanced Techniques in Knowledge Discovery and Data Mining10.1007/1-84628-183-0_3(75-102)Online publication date: 2005
https://doi.org/10.1007/1-84628-183-0_3
Strehl AGhosh J(2003)Relationship-Based Clustering and Visualization for High-Dimensional Data MiningINFORMS Journal on Computing10.1287/ijoc.15.2.208.1444815:2(208-230)Online publication date: 15-Apr-2003
https://dl.acm.org/doi/10.1287/ijoc.15.2.208.14448
Yan Yang Kamel M(2003)Clustering ensemble using swarm intelligenceProceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)10.1109/SIS.2003.1202249(65-71)Online publication date: 2003
https://doi.org/10.1109/SIS.2003.1202249
Strehl AGhosh J(2001)A Scalable Approach to Balanced, High-Dimensional Clustering of Market-BasketsHigh Performance Computing — HiPC 200010.1007/3-540-44467-X_48(525-536)Online publication date: 8-Jun-2001
https://doi.org/10.1007/3-540-44467-X_48
Zomaya AEl-Ghazawi TFrieder O(1999)Guest Editors' IntroductionIEEE Concurrency10.1109/MCC.1999.8069747:4(11-13)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1109/MCC.1999.806974

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient algorithms for mining high-utility itemsets in uncertain databases

Efficiently mining frequent itemsets from very large databases

Scalable mining of large disk-based graph databases