-
1
-
-
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 ACM SIGMOD, pages 207-216, 1993.
-
(1993)
ACM SIGMOD
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
3
-
-
23044517681
-
Constraint-based rule mining in large, dense databases
-
R. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery Journal, pages 217-240, 2000.
-
(2000)
Data Mining and Knowledge Discovery Journal
, pp. 217-240
-
-
Bayardo, R.1
Agrawal, R.2
Gunopulos, D.3
-
4
-
-
0031161999
-
Beyond market baskets: Generalizing association rules to correlations
-
S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In ACM SIGMOD, pages 265-276, 1997.
-
(1997)
ACM SIGMOD
, pp. 265-276
-
-
Brin, S.1
Motwani, R.2
Silverstein, C.3
-
6
-
-
0035789655
-
Empirical bayes screening for multi-item associations
-
W. DuMouchel and D. Pregibon. Empirical bayes screening for multi-item associations. In KDD, pages 67-76, 2001.
-
(2001)
KDD
, pp. 67-76
-
-
DuMouchel, W.1
Pregibon, D.2
-
7
-
-
3142708793
-
Cords: Automatic discovery of correlations and soft functional dependencies
-
I. F. Ilyas, V. Markl, P. J. Haas, P. Brown, and A. Abolnaga. Cords: Automatic discovery of correlations and soft functional dependencies. In ACM SIGMOD, 2004.
-
(2004)
ACM SIGMOD
-
-
Ilyas, I.F.1
Markl, V.2
Haas, P.J.3
Brown, P.4
Abolnaga, A.5
-
8
-
-
13644257591
-
The computational complexity of high-dimensional correlation search
-
C. Jermaine. The computational complexity of high-dimensional correlation search. In ICDM, 2001.
-
(2001)
ICDM
-
-
Jermaine, C.1
-
9
-
-
61349173123
-
Playing hide-and-seek with correlations
-
C. Jermaine. Playing hide-and-seek with correlations. In ACM SIGKDD, 2003.
-
(2003)
ACM SIGKDD
-
-
Jermaine, C.1
-
12
-
-
0012281281
-
Mining association rules with multiple minimum supports
-
B. Liu, W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. In ACM SIGKDD, 1999.
-
(1999)
ACM SIGKDD
-
-
Liu, B.1
Hsu, W.2
Ma, Y.3
-
15
-
-
34748853476
-
Mining confident rules without support requirement
-
K. Wang, Y. He, D. Cheung, and Y. Chin. Mining confident rules without support requirement. In ACM CIKM, 2001.
-
(2001)
ACM CIKM
-
-
Wang, K.1
He, Y.2
Cheung, D.3
Chin, Y.4
-
16
-
-
12244306031
-
Taper: An efficient two-step approach for all-pairs correlation query in transaction databases
-
May
-
H. Xiong, S. Shekhar, P. Tan, and V. Kumar. Taper: An efficient two-step approach for all-pairs correlation query in transaction databases. In Technical Report 03-020, computer science and engineering, University of Minnesota - Twin Cities, May 2003.
-
(2003)
Technical Report 03-020, computer science and engineering, University of Minnesota - Twin Cities
-
-
Xiong, H.1
Shekhar, S.2
Tan, P.3
Kumar, V.4
-
17
-
-
15944412875
-
Identification of functional modules in protein complexes via hyperclique pattern discovery
-
January
-
H. Xiong, X. He, C. Ding, Y. Zhang, V. Kumar, and S. R. Holbrook. Identification of functional modules in protein complexes via hyperclique pattern discovery. In Proc. of the Pacific Symposium on Biocomputing (PSB), January 2005.
-
(2005)
Proc. of the Pacific Symposium on Biocomputing (PSB)
-
-
Xiong, H.1
He, X.2
Ding, C.3
Zhang, Y.4
Kumar, V.5
Holbrook, S.R.6
-
18
-
-
12244275963
-
Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs
-
H. Xiong, S. Shekhar, P Tan, and V. Kumar. Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs. In ACM SIGKDD, pages 334-343, 2004.
-
(2004)
ACM SIGKDD
, pp. 334-343
-
-
Xiong, H.1
Shekhar, S.2
Tan, P.3
Kumar, V.4
|