-
1
-
-
0002221136
-
Fast algorithms for mining association rules
-
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487-499 (1994)
-
(1994)
VLDB 1994
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
-
2
-
-
77950867063
-
Fast Algorithms for Mining Emerging Patterns
-
Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. Springer, Heidelberg
-
Bailey, J., Manoukian, T., Ramamohanarao, K.: Fast Algorithms for Mining Emerging Patterns. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 39-50. Springer, Heidelberg (2002)
-
(2002)
LNCS (LNAI)
, vol.2431
, pp. 39-50
-
-
Bailey, J.1
Manoukian, T.2
Ramamohanarao, K.3
-
3
-
-
84856097545
-
Finding strong groups of friends among friends in social networks
-
Cameron, J.J., Leung, C.K.-S., Tanbeer, S.K.: Finding strong groups of friends among friends in social networks. In: IEEE DASC 2011, pp. 824-831 (2011)
-
(2011)
IEEE DASC 2011
, pp. 824-831
-
-
Cameron, J.J.1
Leung, C.K.-S.2
Tanbeer, S.K.3
-
4
-
-
0039253846
-
Mining frequent patterns without candidate generation
-
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1-12 (2000)
-
(2000)
ACM SIGMOD 2000
, pp. 1-12
-
-
Han, J.1
Pei, J.2
Yin, Y.3
-
5
-
-
3142594274
-
Efficient dynamic mining of constrained frequent sets
-
Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.T.: Efficient dynamic mining of constrained frequent sets. ACM TODS 28(4), 337-389 (2003)
-
(2003)
ACM TODS
, vol.28
, Issue.4
, pp. 337-389
-
-
Lakshmanan, L.V.S.1
Leung, C.K.-S.2
Ng, R.T.3
-
6
-
-
33749565987
-
CoMine: Efficient mining of correlated patterns
-
Lee, Y.-K., Kim, W.-Y., Cai, Y.D., Han, J.: CoMine: efficient mining of correlated patterns. In: IEEE ICDM 2003, pp. 581-584 (2003)
-
(2003)
IEEE ICDM 2003
, pp. 581-584
-
-
Lee, Y.-K.1
Kim, W.-Y.2
Cai, Y.D.3
Han, J.4
-
7
-
-
67649641426
-
Mining of frequent itemsets from streams of uncertain data
-
Leung, C.K.-S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: IEEE ICDE 2009, pp. 1663-1670 (2009)
-
(2009)
IEEE ICDE 2009
, pp. 1663-1670
-
-
Leung, C.K.-S.1
Hao, B.2
-
8
-
-
80052314165
-
Frequent Pattern Mining from Time-Fading Streams of Uncertain Data
-
Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. Springer, Heidelberg
-
Leung, C.K.-S., Jiang, F.: Frequent Pattern Mining from Time-Fading Streams of Uncertain Data. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 252-264. Springer, Heidelberg (2011)
-
(2011)
LNCS
, vol.6862
, pp. 252-264
-
-
Leung, C.K.-S.1
Jiang, F.2
-
9
-
-
84863567189
-
A new class of constraints for constrained frequent pattern mining
-
Leung, C.K.-S., Sun, L.: A new class of constraints for constrained frequent pattern mining. In: ACM SAC 2012, pp. 199-204 (2012)
-
ACM SAC 2012
, vol.2012
, pp. 199-204
-
-
Leung, C.K.-S.1
Sun, L.2
-
10
-
-
84860697181
-
Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data
-
Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. Springer, Heidelberg
-
Leung, C.K.-S., Tanbeer, S.K.: Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data. In: Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 272-287. Springer, Heidelberg (2012)
-
(2012)
LNCS
, vol.7238
, pp. 272-287
-
-
Leung, C.K.-S.1
Tanbeer, S.K.2
-
11
-
-
84872797844
-
Mining Social Networks for Significant Friend Groups
-
Yu, H., Yu, G., Hsu, W., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA Workshops 2012. Springer, Heidelberg
-
Leung, C.K.-S., Tanbeer, S.K.: Mining Social Networks for Significant Friend Groups. In: Yu, H., Yu, G., Hsu, W., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA Workshops 2012. LNCS, vol. 7240, pp. 180-192. Springer, Heidelberg (2012)
-
LNCS
, vol.7240
, Issue.2012
, pp. 180-192
-
-
Leung, C.K.-S.1
Tanbeer, S.K.2
-
12
-
-
78649422350
-
Efficient periodicity mining in time series databases using suffix trees
-
Rasheed, F., Alshalalfa, M., Alhajj, R.: Efficient periodicity mining in time series databases using suffix trees. IEEE TKDE 23(1), 79-94 (2011)
-
(2011)
IEEE TKDE
, vol.23
, Issue.1
, pp. 79-94
-
-
Rasheed, F.1
Alshalalfa, M.2
Alhajj, R.3
-
13
-
-
84860654390
-
Efficient Mining Regularly Frequent Patterns in Transactional Databases
-
Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. Springer, Heidelberg
-
Rashid, M. M., Karim, M. R., Jeong, B.-S., Choi, H.-J.: Efficient Mining Regularly Frequent Patterns in Transactional Databases. In: Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 258-271. Springer, Heidelberg (2012)
-
(2012)
LNCS
, vol.7238
, pp. 258-271
-
-
Rashid, M.M.1
Karim, M.R.2
Jeong, B.-S.3
Choi, H.-J.4
-
14
-
-
77956212881
-
Re-examination of interestingness measures in pattern mining: A unified framework
-
Wu, T., Chen, Y., Han, J.: Re-examination of interestingness measures in pattern mining: a unified framework. Data Mining and Knowledge Discovery 21(3), 371-397 (2010)
-
(2010)
Data Mining and Knowledge Discovery
, vol.21
, Issue.3
, pp. 371-397
-
-
Wu, T.1
Chen, Y.2
Han, J.3
-
15
-
-
33748450904
-
Hyperclique pattern discovery
-
Xiong, H., Tan, P.-N., Kumar, V.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery 13(2), 219-242 (2006)
-
(2006)
Data Mining and Knowledge Discovery
, vol.13
, Issue.2
, pp. 219-242
-
-
Xiong, H.1
Tan, P.-N.2
Kumar, V.3
-
16
-
-
33749250911
-
Mining itemset utilities from transaction databases
-
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. DKE 59(3), 603-626 (2006)
-
(2006)
DKE
, vol.59
, Issue.3
, pp. 603-626
-
-
Yao, H.1
Hamilton, H.J.2
-
17
-
-
34548236885
-
Mining periodic patterns with gap requirement from sequences
-
art. 7
-
Zhang, M., Kao, B., Cheung, D.W., Yip, K.Y.: Mining periodic patterns with gap requirement from sequences. ACM TKDD, 1(2), art. 7 (2007)
-
(2007)
ACM TKDD
, vol.1
, Issue.2
-
-
Zhang, M.1
Kao, B.2
Cheung, D.W.3
Yip, K.Y.4
|