-
1
-
-
0001783073
-
A new framework for itemset generation
-
Seattle, WA, USA, June 1998
-
Aggarawal, C. and P. Yu. 1998. A new framework for itemset generation. In Proceedings of the PODS Conference, Seattle, WA, USA, June 1998, pages 18-24.
-
(1998)
Proceedings of the PODS Conference
, pp. 18-24
-
-
Aggarawal, C.1
Yu, P.2
-
2
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
Washington, D.C., May 1993
-
Agrawal, R., T. Imielinski, and A. Swami. 1993. 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., May 1993.
-
(1993)
Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
3
-
-
0036031891
-
An evolutionary approach for discovering changing patterns in historical data
-
Au, W. and C. Chan. 2002. An evolutionary approach for discovering changing patterns in historical data. In Proceedings of 2002 SPIE, 4730:398-409.
-
(2002)
Proceedings of 2002 SPIE
, vol.4730
, pp. 398-409
-
-
Au, W.1
Chan, C.2
-
4
-
-
85172413460
-
Learning first order logic rules with a genetic algorithm
-
Montreal, Canada
-
Augier, S., G. Venturini, and Y. Kodratoff. 1995. Learning first order logic rules with a genetic algorithm. In Proceedings of the 1st International Conf. Knowledge Discovery and Data Mining, pages 21-26, Montreal, Canada.
-
(1995)
Proceedings of the 1st International Conf. Knowledge Discovery and Data Mining
, pp. 21-26
-
-
Augier, S.1
Venturini, G.2
Kodratoff, Y.3
-
5
-
-
0031161999
-
Beyond market baskets: Generalizing association rules to correlations
-
Tucson, AZ, USA, May 1997
-
Brin, S., R. Motwani, and C. Silverstein. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, AZ, USA, May 1997, pages 265-276.
-
(1997)
IProceedings of the ACM SIGMOD International Conference on Management of Data
, pp. 265-276
-
-
Brin, S.1
Motwani, R.2
Silverstein, C.3
-
6
-
-
0033671768
-
Discovering comprehensible classification rules with a genetic algorithm
-
La Jolla, CA, USA, July 2000
-
Fidelis, M., H. Lopes, and A. Freitas. 2000. Discovering comprehensible classification rules with a genetic algorithm. In Proceedings of the 2000 Congress on Evolutionary Computation, pages 805-810, La Jolla, CA, USA, July 2000.
-
(2000)
Proceedings of the 2000 Congress on Evolutionary Computation
, pp. 805-810
-
-
Fidelis, M.1
Lopes, H.2
Freitas, A.3
-
8
-
-
0012141368
-
A survey of evolutionary algorithms for data mining and knowledge discovery
-
Berlin, Springer-Verlag
-
Freitas, A. 2002. A survey of evolutionary algorithms for data mining and knowledge discovery. In: Advances in Evolutionary Computation, Berlin, Springer-Verlag.
-
(2002)
Advances in Evolutionary Computation
-
-
Freitas, A.1
-
9
-
-
0039253846
-
Mining frequent patterns without candidate generation
-
Dallas, TX, USA
-
Han, J., J. Pei, and Y. Yin. 2000. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, USA, pages 1-12.
-
(2000)
Proceedings of the ACM SIGMOD International Conference on Management of Data
, pp. 1-12
-
-
Han, J.1
Pei, J.2
Yin, Y.3
-
10
-
-
0034593047
-
Small is beautiful: Discovering the minimal set of unexpected patterns
-
Dallas, TX, USA
-
Padmanabhan, B. and A. Tuzhilin. 2000. Small is beautiful: Discovering the minimal set of unexpected patterns. In Proceedings of ACM SIGKDD, Dallas, TX, USA, pages 54-63.
-
(2000)
Proceedings of ACM SIGKDD
, pp. 54-63
-
-
Padmanabhan, B.1
Tuzhilin, A.2
-
11
-
-
0031220368
-
Using a hash-based method with transaction trimming for mining association rules
-
Park, J., M. Chen, and P. Yu. 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowledge and Data Eng. 9(5): 813-824
-
(1997)
IEEE Trans. Knowledge and Data Eng.
, vol.9
, Issue.5
, pp. 813-824
-
-
Park, J.1
Chen, M.2
Yu, P.3
-
12
-
-
11144335920
-
Pattern discovery from data using genetic algorithm
-
Singapore, Feb. 1997
-
Pei, M., E. Goodman, and W. Punch. 1997. Pattern discovery from data using genetic algorithm. In Proceedings of the 1st Pacific - Asia Conf. Knowledge Discovery and Data, Mining, Singapore, Feb. 1997, pages 264-276.
-
(1997)
Proceedings of the 1st Pacific - Asia Conf. Knowledge Discovery and Data, Mining
, pp. 264-276
-
-
Pei, M.1
Goodman, E.2
Punch, W.3
-
13
-
-
0002877253
-
Discovery, analysis and presentation of strong rules
-
eds. G. Piatetsky-Shapiro and W. Frawley, Cambridge, MA: AMI Press/MIT Press
-
Piatetsky-Shapiro, G. 1991. Discovery, analysis and presentation of strong rules. In: Knowledge Discovery in Databases, eds. G. Piatetsky-Shapiro and W. Frawley, 229-248, Cambridge, MA: AMI Press/MIT Press.
-
(1991)
Knowledge Discovery in Databases
, pp. 229-248
-
-
Piatetsky-Shapiro, G.1
-
16
-
-
0034592782
-
Efficient search for association rules
-
New York
-
Webb, G. 2000. Efficient search for association rules. In Proceedings of ACM SIGKDD, New York, pages 99-107.
-
(2000)
Proceedings of ACM SIGKDD
, pp. 99-107
-
-
Webb, G.1
-
18
-
-
3042700702
-
Mining both positive and negative association rules
-
Sydney, Australia, July 2002
-
Wu, X., C. Zhang, and S. Zhang. 2002. Mining both positive and negative association rules. In Proceedings of the 19th International Conference on Machine Learning, pages 658-665, Sydney, Australia, July 2002.
-
(2002)
Proceedings of the 19th International Conference on Machine Learning
, pp. 658-665
-
-
Wu, X.1
Zhang, C.2
Zhang, S.3
-
20
-
-
0037275123
-
Identifying approximate itemsets of interest in large databases
-
Zhang, C., S. Zhang, and G. Webb. 2003. Identifying approximate itemsets of interest in large databases. Applied Intelligence 18: 91-104.
-
(2003)
Applied Intelligence
, vol.18
, pp. 91-104
-
-
Zhang, C.1
Zhang, S.2
Webb, G.3
|