-
2
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
Washington, D.C., USA, May ACM Press
-
R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., USA, May 1993. ACM Press.
-
(1993)
Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.N.3
-
3
-
-
0001371923
-
Fast discovery of association rules
-
AAAI Press
-
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
-
(1996)
Advances in Knowledge Discovery and Data Mining
, pp. 307-328
-
-
Agrawal, R.1
Mannila, H.2
Srikant, R.3
Toivonen, H.4
Verkamo, A.I.5
-
4
-
-
0032680184
-
Constraint-based rule mining in large, dense databases
-
Sydney, Australia, March
-
R. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proceedings ICDE'99, pages 188-197, Sydney, Australia, March 1999.
-
(1999)
Proceedings ICDE'99
, pp. 188-197
-
-
Bayardo, R.1
Agrawal, R.2
Gunopulos, D.3
-
6
-
-
84974681737
-
Approximation of frequency queries by mean of free-sets
-
Lyon, France, September
-
J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by mean of free-sets. In Proc. of the 4th European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), pages 75-85, Lyon, France, September 2000.
-
(2000)
Proc. of the 4th European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'00)
, pp. 75-85
-
-
Boulicaut, J.-F.1
Bykowski, A.2
Rigotti, C.3
-
7
-
-
0037243046
-
Free-sets: A condensed representation of boolean data for the approximation of frequency queries
-
J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets : a condensed representation of boolean data for the approximation of frequency queries. Journal of Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
-
(2003)
Journal of Data Mining and Knowledge Discovery
, vol.7
, Issue.1
, pp. 5-22
-
-
Boulicaut, J.-F.1
Bykowski, A.2
Rigotti, C.3
-
8
-
-
84947721195
-
Querying inductive databases: A case study on the MINE RULE operator
-
Proc. PKDD'98 Nantes, F, Springer-Verlag
-
J.-F. Boulicaut, M. Klemettinen, and H. Mannila. Querying inductive databases: A case study on the MINE RULE operator. In Proc. PKDD'98, volume 1510 of LNAI, pages 194-202, Nantes, F, 1998. Springer-Verlag.
-
(1998)
LNAI
, vol.1510
, pp. 194-202
-
-
Boulicaut, J.-F.1
Klemettinen, M.2
Mannila, H.3
-
9
-
-
0034832877
-
A condensed representation to find frequent patterns
-
Santa Barbara, CA, USA, May ACM
-
A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In Proc. of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'01), pages 267-273, Santa Barbara, CA, USA, May 2001. ACM.
-
(2001)
Proc. of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'01)
, pp. 267-273
-
-
Bykowski, A.1
Rigotti, C.2
-
10
-
-
35048877105
-
Disjunction-bordered condensed representation of frequent patterns
-
To appear
-
A. Bykowski and C. Rigotti. Disjunction-bordered condensed representation of frequent patterns. Information Systems, To appear.
-
Information Systems
-
-
Bykowski, A.1
Rigotti, C.2
-
12
-
-
0002784345
-
Algorithms for association rule mining - A general survey and comparison
-
July
-
J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2(1):58-64, July 2000.
-
(2000)
SIGKDD Explorations
, vol.2
, Issue.1
, pp. 58-64
-
-
Hipp, J.1
Güntzer, U.2
Nakhaeizadeh, G.3
-
13
-
-
0030284618
-
A database perspective on knowledge discovery
-
Nov.
-
T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, Nov. 1996.
-
(1996)
Communications of the ACM
, vol.39
, Issue.11
, pp. 58-64
-
-
Imielinski, T.1
Mannila, H.2
-
14
-
-
0001267179
-
Pruning and summarizing the discovered associations
-
San Diego, CA, USA, August
-
B. Liu, W. Hsu, and Y. Ma. Pruning and summarizing the discovered associations. In Proc. of the Fifth Int. Conference on Knowledge Discovery and Data Mining (KDD'99), pages 125-134, San Diego, CA, USA, August 1999.
-
(1999)
Proc. of the Fifth Int. Conference on Knowledge Discovery and Data Mining (KDD'99)
, pp. 125-134
-
-
Liu, B.1
Hsu, W.2
Ma, Y.3
-
15
-
-
9444249299
-
Inductive databases and condensed representations for data mining
-
Port Jefferson, USA, MIT Press
-
H. Mannila. Inductive databases and condensed representations for data mining. In Proc. ILPS'97, pages 21-30, Port Jefferson, USA, 1997. MIT Press.
-
(1997)
Proc. ILPS'97
, pp. 21-30
-
-
Mannila, H.1
-
16
-
-
0033096890
-
Efficient mining of association rules using closed itemset lattices
-
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
-
(1999)
Information Systems
, vol.24
, Issue.1
, pp. 25-46
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
17
-
-
0002877253
-
Discovery, analysis, and presentation of strong rules
-
AAAI Press, Menlo Park, CA
-
G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248. AAAI Press, Menlo Park, CA, 1991.
-
(1991)
Knowledge Discovery in Databases
, pp. 229-248
-
-
Piatetsky-Shapiro, G.1
-
18
-
-
0002082857
-
An efficient algorithm for mining association rules in large databases
-
Zurich, Switzerland, September Morgan Kaufmann
-
A. Savasere, E. Omiecinski, and S. B. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. VLDB'95, pages 432-444, Zurich, Switzerland, September 1995. Morgan Kaufmann.
-
(1995)
Proc. VLDB'95
, pp. 432-444
-
-
Savasere, A.1
Omiecinski, E.2
Navathe, S.B.3
-
20
-
-
0030157416
-
Mining quantitative association rules in large relational tables
-
Montreal, Quebec, Canada, June ACM Press
-
R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. ACM SIGMOD'96, pages 1-12, Montreal, Quebec, Canada, June 1996. ACM Press.
-
(1996)
Proc. ACM SIGMOD'96
, pp. 1-12
-
-
Srikant, R.1
Agrawal, R.2
|