-
2
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of 1993 ACM-SIGMOD Int. Conf. on Management of Data, Washington, D.C., 1993.
-
Proc. of 1993 ACM-SIGMOD Int. Conf. on Management of Data, Washington, D.C., 1993
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
3
-
-
0037575076
-
Multivariate versus univariate decision trees
-
Technical report, University of Massachusetts
-
C.E. Brodley and P.E. Utgoff. Multivariate versus univariate decision trees. Technical report, University of Massachusetts, 1992.
-
(1992)
-
-
Brodley, C.E.1
Utgoff, P.E.2
-
6
-
-
0025389210
-
Boolean feature discovery in empirical learning
-
P.G. and H.D. Boolean feature discovery in empirical learning. Machine Learning, 1990.
-
(1990)
Machine Learning
-
-
-
10
-
-
78149313084
-
Cmar: Accurate and efficient classification based on multiple class-association rules
-
Also available as a UMN-CS technical report, TR#01-026
-
W. Li, J. Han, and J. Pei. Cmar: Accurate and efficient classification based on multiple class-association rules. In IEEE International Conference on Data Mining, 2001. Also available as a UMN-CS technical report, TR#01-026.
-
IEEE International Conference on Data Mining, 2001
-
-
Li, W.1
Han, J.2
Pei, J.3
-
13
-
-
0003408496
-
UCI repository of machine learning databases
-
C. Merz and P. Murphy. UCI repository of machine learning databases, 1998.
-
(1998)
-
-
Merz, C.1
Murphy, P.2
-
17
-
-
0008087071
-
Pattern recognition as knowledge guided computer induction
-
Technical report, University of Illinois at Urbana Champaign
-
M.R.S. Pattern recognition as knowledge guided computer induction. Technical report, University of Illinois at Urbana Champaign, 1978.
-
(1978)
-
-
-
18
-
-
47349084243
-
Lpminer: An algorithm for finding frequent itemsets using length-decreasing support constraint
-
Also available as a UMN-CS technical report, TR#01-026
-
M. Seno and G. Karypis. Lpminer: An algorithm for finding frequent itemsets using length-decreasing support constraint. In IEEE International Conference on Data Mining, 2001. Also available as a UMN-CS technical report, TR#01-026.
-
IEEE International Conference on Data Mining, 2001
-
-
Seno, M.1
Karypis, G.2
-
19
-
-
0026902042
-
An information theoretic approach to rule induction from databases
-
August
-
P. Smyth and R.M. Goodman. An information theoretic approach to rule induction from databases. IEEE transactions on Knowledge and Data Engineering, 4(4):301-316, August 1992.
-
(1992)
IEEE Transactions on Knowledge and Data Engineering
, vol.4
, Issue.4
, pp. 301-316
-
-
Smyth, P.1
Goodman, R.M.2
-
21
-
-
0001001098
-
Feature selection for svms
-
J. Weston, S. Mukherjee, O. Chapelle, M. Pontil, T. Poggio, and V. Vapnik. Feature selection for svms. Advances in Neural Information Processing Systems, 2000.
-
(2000)
Advances in Neural Information Processing Systems
-
-
Weston, J.1
Mukherjee, S.2
Chapelle, O.3
Pontil, M.4
Poggio, T.5
Vapnik, V.6
-
23
-
-
0033718951
-
Scalable algorithms for association mining
-
M.J. Zaki. Scalable algorithms for association mining. Knowledge and Data Engineering, 12(2):372-390, 2000.
-
(2000)
Knowledge and Data Engineering
, vol.12
, Issue.2
, pp. 372-390
-
-
Zaki, M.J.1
-
26
-
-
0038589179
-
A comparison of constructive induction with different types of new attribute
-
Technical report, School of Computing and Mathematics, Deakin University, Geelong, Victoria, Australia
-
Z. Zijian. A comparison of constructive induction with different types of new attribute. Technical report, School of Computing and Mathematics, Deakin University, Geelong, Victoria, Australia, 1996.
-
(1996)
-
-
Zijian, Z.1
|