-
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," Proc. 1993 ACM SIGMOD Int'l Conf. Management of Data, pp. 207-216, 1993.
-
(1993)
Proc. 1993 ACM SIGMOD Int'l Conf. Management of Data
, 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 J., pp. 217-240, 2000.
-
(2000)
Data Mining and Knowledge Discovery J.
, 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," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 265-276, 1997.
-
(1997)
Proc. ACM SIGMOD Int'l Conf. Management of Data
, pp. 265-276
-
-
Brin, S.1
Motwani, R.2
Silverstein, C.3
-
5
-
-
0037865635
-
Dualminer: A dual-pruning algorithm for itemsets with constraints
-
C. Bucila, J. Gehrke, D. Kifer, and W.M. White, "Dualminer: A Dual-Pruning Algorithm for Itemsets with Constraints," Data Mining and Knowledge Discovery J. pp. 241-272, 2003.
-
(2003)
Data Mining and Knowledge Discovery J
, pp. 241-272
-
-
Bucila, C.1
Gehrke, J.2
Kifer, D.3
White, W.M.4
-
6
-
-
0035007850
-
Mafia: A maximal frequent itemset algorithm for transactional databases
-
D. Burdick, M. Calimlim, and J. Gehrke, "Mafia: A Maximal Frequent Itemset Algorithm for Transactional Databases," Proc. 17th Int'l Conf. Data Eng. (ICDE), pp. 443-452, 2001.
-
(2001)
Proc. 17th Int'l Conf. Data Eng. (ICDE)
, pp. 443-452
-
-
Burdick, D.1
Calimlim, M.2
Gehrke, J.3
-
7
-
-
0033877655
-
Finding interesting associations without support pruning
-
E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J.D. Ullman, and C. Yang, "Finding Interesting Associations without Support Pruning," Proc. 16th Int'l Conf. Data Eng. (ICDE), pp. 489-499, 2000.
-
(2000)
Proc. 16th Int'l Conf. Data Eng. (ICDE)
, pp. 489-499
-
-
Cohen, E.1
Datar, M.2
Fujiwara, S.3
Gionis, A.4
Indyk, P.5
Motwani, R.6
Ullman, J.D.7
Yang, C.8
-
8
-
-
0003519438
-
-
Lawrence Erlbaum Assoc.
-
P. Cohen, J. Cohen, S.G. West, and L. Aiken, Applied Multiple Regression/Correlation Analysis for the Behavioral Science, third ed. Lawrence Erlbaum Assoc., 2002.
-
(2002)
Applied Multiple Regression/Correlation Analysis for the Behavioral Science, Third Ed.
-
-
Cohen, P.1
Cohen, J.2
West, S.G.3
Aiken, L.4
-
10
-
-
0033892546
-
Efficient mining of constrained correlated sets
-
G. Grahne, L.S. Lakshmanan, and X. Wang, "Efficient Mining of Constrained Correlated Sets," Proc. 16th Int'l Conf. Data Eng., pp. 512-521, 2000.
-
(2000)
Proc. 16th Int'l Conf. Data Eng.
, pp. 512-521
-
-
Grahne, G.1
Lakshmanan, L.S.2
Wang, X.3
-
12
-
-
3142708793
-
Cords: Automatic discovery of correlations and soft functional dependencies
-
I.F. Ilyas, V. Markl, P.J. Haas, P. Brown, and A. Aboulnaga, "Cords: Automatic Discovery of Correlations and Soft Functional Dependencies," Proc. 2004 ACM SIGMOD Int'l Conf. Management of Data, 2004.
-
(2004)
Proc. 2004 ACM SIGMOD Int'l Conf. Management of Data
-
-
Ilyas, I.F.1
Markl, V.2
Haas, P.J.3
Brown, P.4
Aboulnaga, A.5
-
13
-
-
13644257591
-
The computational complexity of high-dimensional correlation search
-
C. Jermaine, "The Computational Complexity of High-Dimensional Correlation Search," Proc. 2001 IEEE Int'l Conf. Data Mining (ICDM), pp. 249-256, 2001.
-
(2001)
Proc. 2001 IEEE Int'l Conf. Data Mining (ICDM)
, pp. 249-256
-
-
Jermaine, C.1
-
17
-
-
0036211063
-
Analysis of matched mRNA measurements from two different microarray technologies
-
W.P. Kuo, T. Jenssen, A.J. Butte, L. Ohno-Machado, and I.S. Kohane, "Analysis of Matched mRNA Measurements from Two Different Microarray Technologies," Bioinformatics, vol. 18, no. 3, 2002.
-
(2002)
Bioinformatics
, vol.18
, Issue.3
-
-
Kuo, W.P.1
Jenssen, T.2
Butte, A.J.3
Ohno-Machado, L.4
Kohane, I.S.5
-
19
-
-
0001267179
-
Mining association rules with multiple minimum supports
-
B. Liu, W. Hsu, and Y. Ma, "Mining Association Rules with Multiple Minimum Supports," Proc. ACM SIGKDD, 1999.
-
(1999)
Proc. ACM SIGKDD
-
-
Liu, B.1
Hsu, W.2
Ma, Y.3
-
20
-
-
84875118998
-
Exploratory mining via constrained frequent set queries
-
R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, "Exploratory Mining via Constrained Frequent Set Queries," Proc. ACM SIGMOD Int'l Conf. Management Data, 1999.
-
(1999)
Proc. ACM SIGMOD Int'l Conf. Management Data
-
-
Ng, R.1
Lakshmanan, L.V.S.2
Han, J.3
Pang, A.4
-
21
-
-
0036184255
-
Mining optimized association rules with categorical and numeric attributes
-
Jan.
-
R. Rastogi and K. Shim, "Mining Optimized Association Rules with Categorical and Numeric Attributes," IEEE Trans. Knowledge and Data Eng., vol. 14, no. 1, Jan. 2002.
-
(2002)
IEEE Trans. Knowledge and Data Eng
, vol.14
, Issue.1
-
-
Rastogi, R.1
Shim, K.2
-
26
-
-
0035747399
-
Mining confident rules without support requirement
-
K. Wang, Y. He, D. Cheung, and Y.L. Chin, "Mining Confident Rules without Support Requirement," Proc. 2001 ACM Int'l Conf. Information and Knowledge Management (CIKM), 2001.
-
(2001)
Proc. 2001 ACM Int'l Conf. Information and Knowledge Management (CIKM)
-
-
Wang, K.1
He, Y.2
Cheung, D.3
Chin, Y.L.4
-
27
-
-
3042700702
-
Mining both positive and negative association rules
-
X. Wu, C. Zhang, and S. Zhang, "Mining Both Positive and Negative Association Rules," Proc. 19th Int'l Conf. Machine Learning (ICML), pp. 658-665, 2002.
-
(2002)
Proc. 19th Int'l Conf. Machine Learning (ICML)
, pp. 658-665
-
-
Wu, X.1
Zhang, C.2
Zhang, S.3
-
28
-
-
12244275963
-
Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs
-
Aug.
-
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," Proc. 10th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 334-343, Aug. 2004.
-
(2004)
Proc. 10th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining
, pp. 334-343
-
-
Xiong, H.1
Shekhar, S.2
Tan, P.3
Kumar, V.4
|