|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
|
| |
3
|
Rakesh Agrawal , Heikki Mannila , Ramakrishnan Srikant , Hannu Toivonen , A. Inkeri Verkamo, Fast discovery of association rules, Advances in knowledge discovery and data mining, American Association for Artificial Intelligence, Menlo Park, CA, 1996
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
 |
7
|
Sergey Brin , Rajeev Motwani , Craig Silverstein, Beyond market baskets: generalizing association rules to correlations, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.265-276, May 11-15, 1997, Tucson, Arizona, United States
|
 |
8
|
Sergey Brin , Rajeev Motwani , Jeffrey D. Ullman , Shalom Tsur, Dynamic itemset counting and implication rules for market basket data, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.255-264, May 11-15, 1997, Tucson, Arizona, United States
|
 |
9
|
Sergey Brin , Rajeev Rastogi , Kyuseok Shim, Mining optimized gain rules for numeric attributes, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.135-144, August 15-18, 1999, San Diego, California, United States
[doi> 10.1145/312129.312217]
|
| |
10
|
|
| |
11
|
David W. Cheung , Jiawei Han , Vincent T. Ng , Ada W. Fu , Yongjian Fu, A fast distributed algorithm for mining association rules, Proceedings of the fourth international conference on on Parallel and distributed information systems, p.31-43, December 18-20, 1996, Miami Beach, Florida, United States
|
| |
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
|
| |
13
|
|
 |
14
|
Takeshi Fukuda , Yasukiko Morimoto , Shinichi Morishita , Takeshi Tokuyama, Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.13-23, June 04-06, 1996, Montreal, Quebec, Canada
|
 |
15
|
Takeshi Fukuda , Yasuhido Morimoto , Shinichi Morishita , Takeshi Tokuyama, Mining optimized association rules for numeric attributes, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.182-191, June 04-06, 1996, Montreal, Quebec, Canada
[doi> 10.1145/237661.237708]
|
| |
16
|
|
| |
17
|
|
 |
18
|
Eui-Hong Han , George Karypis , Vipin Kumar, Scalable parallel data mining for association rules, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.277-288, May 11-15, 1997, Tucson, Arizona, United States
|
| |
19
|
|
| |
20
|
Minos N. Garofalakis, RaJeev Rastogi and Kyuseok Shim, SPIRIT: Sequeatial Pattern Mining with
|
| |
21
|
Regular Expression Constraints, the VLDB Conference, Edinburgh, Scotland, UK, 1999
|
| |
22
|
|
| |
23
|
|
| |
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.
|
 |
25
|
Raymond T. Ng , Laks V. S. Lakshmanan , Jiawei Han , Alex Pang, Exploratory mining and pruning optimizations of constrained associations rules, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.13-24, June 01-04, 1998, Seattle, Washington, United States
|
| |
26
|
|
 |
27
|
Jong Soo Park , Ming-Syan Chen , Philip S. Yu, An effective hash-based algorithm for mining association rules, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.175-186, May 22-25, 1995, San Jose, California, United States
|
| |
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.
|
| |
29
|
|
| |
30
|
|
| |
31
|
RaJeev ~asCogi and Kyuseok Shim, Mining optimized support rules for numeric attributes, Int'l Conference on Data Engineering, Sydney, Australia, March 1999.
|
| |
32
|
|
| |
33
|
|
 |
34
|
|
| |
35
|
|
 |
36
|
|
| |
37
|
|
| |
38
|
|
 |
39
|
Dick Tsur , Jeffrey D. Ullman , Serge Abiteboul , Chris Clifton , Rajeev Motwani , Svetlozar Nestorov , Arnon Rosenthal, Query flocks: a generalization of association-rule mining, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.1-12, June 01-04, 1998, Seattle, Washington, United States
|
| |
40
|
|
| |
41
|
|
| |
42
|
L. Bretman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees, Wadsworth, Belmont, 1984.
|
| |
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.
|
| |
44
|
|
| |
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.
|
| |
46
|
|
 |
47
|
Johannes Gehrke , Venkatesh Ganti , Raghu Ramakrishnan , Wei-Yin Loh, BOAT—optimistic decision tree construction, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.169-180, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
| |
48
|
|
| |
49
|
|
| |
50
|
E, B. Hunt, J. Matin, and P. J. Stone, editors, Ibq~eriments in Induction, Academic Press, New York, 1966.
|
| |
51
|
R. Krichevsky and V. Trofimmv, The perfornlance of universal encoding, IEE~ Transactions on Infozlmatton Theory, 27(2), I981.
|
| |
52
|
|
| |
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.
|
| |
54
|
|
| |
55
|
|
| |
56
|
|
| |
57
|
|
| |
58
|
J. Ross QUinlan, c4.5: Programs for and Neural Networks, Cambridge University Press, Cambridge, 1996. Machine Learning, Morgan Kauf~an, 1993.
|
| |
59
|
|
| |
60
|
B.D. Rlpley, Pattern Recognition
|
| |
61
|
J. Rtssanen, Modeling by shortest data description, Automatics, 14, 1978.
|
| |
62
|
|
| |
63
|
|
 |
64
|
Charu C. Aggarwal , Joel L. Wolf , Philip S. Yu , Cecilia Procopiuc , Jong Soo Park, Fast algorithms for projected clustering, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.61-72, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
 |
65
|
Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.94-105, June 01-04, 1998, Seattle, Washington, United States
|
 |
66
|
Mihael Ankerst , Markus M. Breunig , Hans-Peter Kriegel , Jörg Sander, OPTICS: ordering points to identify the clustering structure, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.49-60, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
 |
67
|
Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
|
| |
68
|
Richard O. Duds a~d Peter E. Hard, Pattern Classification and Scene AX~alysis, A Wiley- Interscience Publication, New York, 1973.
|
| |
69
|
|
| |
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.
|
| |
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.
|
| |
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.
|
 |
73
|
Christos Faloutsos , King-Ip Lin, FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.163-174, May 22-25, 1995, San Jose, California, United States
|
| |
74
|
|
| |
75
|
|
 |
76
|
Sudipto Guha , Rajeev Rastogi , Kyuseok Shim, CURE: an efficient clustering algorithm for large databases, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.73-84, June 01-04, 1998, Seattle, Washington, United States
|
| |
77
|
|
| |
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.
|
| |
79
|
|
| |
80
|
|
| |
81
|
|
 |
82
|
Tian Zhang , Raghu Ramakrishnan , Miron Livny, BIRCH: an efficient data clustering method for very large databases, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.103-114, June 04-06, 1996, Montreal, Quebec, Canada
|
| |
83
|
|
| |
84
|
Rakesh Agrawal , King-Ip Lin , Harpreet S. Sawhney , Kyuseok Shim, Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases, Proceedings of the 21th International Conference on Very Large Data Bases, p.490-501, September 11-15, 1995
|
| |
85
|
|
| |
86
|
|
| |
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.
|
| |
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.
|
 |
89
|
Christos Faloutsos , M. Ranganathan , Yannis Manolopoulos, Fast subsequence matching in time-series databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.419-429, May 24-27, 1994, Minneapolis, Minnesota, United States
|
| |
90
|
|
| |
91
|
Joseph M. Hellerstein, Elias Koutsoupias, and Christos H. Papadimitriou, On the analysis of indexing schemes, the ACM PODS, Seattle, WA, May 1998.
|
 |
92
|
H. V. Jagadish , Alberto O. Mendelzon , Tova Milo, Similarity-based queries, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.36-45, May 22-25, 1995, San Jose, California, United States
[doi> 10.1145/212433.212444]
|
 |
93
|
|
| |
94
|
|
| |
95
|
|
| |
96
|
C. Faloutsos , R. Barber , M. Flickner , J. Hafner , W. Niblack , D. Petkovic , W. Equitz, Efficient and effective querying by image content, Journal of Intelligent Information Systems, v.3 n.3-4, p.231-262, July 1994
[doi> 10.1007/BF00962238]
|
| |
97
|
Myron Flickner , Harpreet Sawhney , Wayne Niblack , Jonathan Ashley , Qian Huang , Byron Dom , Monika Gorkani , Jim Hafner , Denis Lee , Dragutin Petkovic , David Steele , Peter Yanker, Query by Image and Video Content: The QBIC System, Computer, v.28 n.9, p.23-32, September 1995
[doi> 10.1109/2.410146
]
|
 |
98
|
|
| |
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~.
|
 |
100
|
|
 |
101
|
Apostol Natsev , Rajeev Rastogi , Kyuseok Shim, WALRUS: a similarity retrieval algorithm for image databases, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.395-406, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
| |
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.
|
| |
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.
|
| |
104
|
R. W. Picard and T. Kabir, Finding similar patterns in large image databases, IEEE ICASSP, volume V, Minneapolis, 1993.
|
| |
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.
|
| |
106
|
|
| |
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.
|
| |
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.
|
| |
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.
|
| |
110
|
V. Barnett and T. Lewis, Outliers in Statistical Data, Joh~ Wiley and Sons, New York, I994.
|
| |
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.
|
| |
112
|
Sridhar Ramaswamy, Rajeev Rastogi and Kyuseok shim, Efficient algorithms for mining outliers from large data sets, Technical report, Bell Laboratories, Murray Hill, 1998.
|
| |
113
|
|
| |
114
|
|
|