-
2
-
-
0002221136
-
Fa st algorithms for mining association rules
-
R. Agrawal & R. Srikant, "Fa st algorithms for mining association rules," in VLDB 1994, pp. 487-499.
-
(1994)
VLDB
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
-
3
-
-
84886058881
-
Consistent process mining over big data triple stores
-
A. Azzini & P. Ceravolo, "Consistent process mining over Big data triple stores, " in IEEE Big Data Congress 2013, pp. 54-61.
-
(2013)
IEEE Big Data Congress
, pp. 54-61
-
-
Azzini, A.1
Ceravolo, P.2
-
4
-
-
84880523126
-
Machine learning for big data
-
T. Condie, P. Mineiro, N. Polyzotis, & M. Weimer, " Machine learning for Big data," in ACM SIGMOD 2013, pp. 939-942.
-
(2013)
ACM SIGMOD
, pp. 939-942
-
-
Condie, T.1
Mineiro, P.2
Polyzotis, N.3
Weimer, M.4
-
5
-
-
80052686089
-
Clustering very large multi-dimensional datasets with mapreduce
-
R.L.F. Cordeiro, C. Traina Jr. , A.J.M. Traina, J. López, U. Kang, & C. Faloutsos, " Clustering very large multi-dimensional datasets with MapReduce," in ACM KDD 2011, pp. 690-698.
-
(2011)
ACM KDD
, pp. 690-698
-
-
Cordeiro, R.L.F.1
Traina, C.2
Traina, A.J.M.3
López, J.4
Kang, U.5
Faloutsos, C.6
-
6
-
-
37549003336
-
Mapreduce: Simplified data processing on large clusters
-
Jan
-
J. Dean & S. Ghemawat, "MapReduce: simplified data processing on large clusters, " CACM 51(1): 107-113, Jan. 2008.
-
(2008)
CACM
, vol.51
, Issue.1
, pp. 107-113
-
-
Dean, J.1
Ghemawat, S.2
-
7
-
-
56349095269
-
Fast parallel outlier detection for categorical datasets using mapreduce
-
A. Koufakou, J. Secretan, J. Reeder, K. Cardona, & M. Georgiopoulos, " Fast parallel outlier detection for categorical datasets using MapReduce," in IEEE IJCNN 2008, pp. 3298-3304.
-
(2008)
IEEE IJCNN
, pp. 3298-3304
-
-
Koufakou, A.1
Secretan, J.2
Reeder, J.3
Cardona, K.4
Georgiopoulos, M.5
-
8
-
-
84875277978
-
Hazy: Making it easier to build and maintain big-data analytics
-
Mar
-
A. Kumar, F. Niu, & C. Ré, " Hazy: making it easier to build and maintain Big-data analytics," CACM 56(3): 40-49, Mar. 2013.
-
(2013)
CACM
, vol.56
, Issue.3
, pp. 40-49
-
-
Kumar, A.1
Niu, F.2
Ré, C.3
-
9
-
-
3142594274
-
Efficient dynamic mining of constrained frequent sets
-
Dec
-
L.V.S. Lakshmanan, C.K.-S. Leung, & R.T. Ng, " Efficient dynamic mining of constrained frequent sets," ACM TODS 28(4): 337-389, Dec. 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
-
10
-
-
67649659407
-
Frequent itemset mining with constraints
-
C.K.-S. Leung, "Frequent itemset mining with constraints, " in Encyclopedia of Database Systems, pp. 1179-1183, 2009.
-
(2009)
Encyclopedia of Database Systems
, pp. 1179-1183
-
-
Leung, C.K.-S.1
-
12
-
-
79959320027
-
Frequent itemset mining of uncertain data streams using the damped window model
-
C.K.-S. Leung & F. Jiang, " Frequent itemset mining of uncertain data streams using the damped window model," in ACM SAC 2011, pp. 950-955.
-
(2011)
ACM SAC
, pp. 950-955
-
-
Leung, C.K.-S.1
Jiang, F.2
-
13
-
-
80052314165
-
Frequent pattern mining from time-fading streams of uncertain data
-
C.K.-S. Leung & F. Jiang, " Frequent pattern mining from time-fading streams of uncertain data," in DaWaK 2011 (LNCS 6862), pp. 252-264.
-
DaWaK 2011 (LNCS 6862
, pp. 252-264
-
-
Leung, C.K.-S.1
Jiang, F.2
-
14
-
-
44649151137
-
A tree-based approach for frequent pattern mining from uncertain data
-
(LNAI 5012
-
C.K.-S. Leung, M.A.F. Mateo, & D.A. Brajczuk, " A tree-based approach for frequent pattern mining from uncertain data," in PAKDD 2008 (LNAI 5012), pp. 653-661.
-
(2008)
PAKDD
, pp. 653-661
-
-
Leung, C.K.-S.1
Mateo, M.A.F.2
Brajczuk, D.A.3
-
15
-
-
84860697181
-
Fast tree-based mining of frequent itemsets from uncertain data
-
(LNCS 7238
-
C.K.-S. Leung & S.K. Tanbeer, " Fast tree-based mining of frequent itemsets from uncertain data," in DASFAA 2012 (LNCS 7238), pp. 272-287.
-
(2012)
DASFAA
, pp. 272-287
-
-
Leung, C.K.-S.1
Tanbeer, S.K.2
-
16
-
-
84893540013
-
Puf-tree: A compact tree structure for frequent pattern mining of uncertain data
-
(LNCS 7818
-
C.K.-S. Leung & S.K. Tanbeer, " PUF-tree: A compact tree structure for frequent pattern mining of uncertain data," in PAKDD 2013 (LNCS 7818), pp. 13-25.
-
(2013)
PAKDD
, pp. 13-25
-
-
Leung, C.K.-S.1
Tanbeer, S.K.2
-
17
-
-
84860502035
-
Apriori-based frequent itemset mining algorithms on mapreduce
-
art
-
M.-Y. Lin, P.-Y. Lee, & S.-C. Hsueh, " Apriori-based frequent itemset mining algorithms on MapReduce," in ICUIMC 2012, art. 76.
-
(2012)
ICUIMC
, vol.76
-
-
Lin, M.-Y.1
Lee, P.-Y.2
Hsueh, S.-C.3
-
18
-
-
84860443491
-
From databases to big data
-
May-June
-
S. Madden, From databases to big data IEEE Internet Computing 16, 3, 4-6, May-June 2012.
-
(2012)
IEEE Internet Computing
, vol.16
, Issue.3
, pp. 4-6
-
-
Madden, S.1
-
19
-
-
0032092760
-
Exploratory mining and pruning optimizations of constrained associations rules
-
R.T., Ng, L.V.S. Lakshmanan, J. Han, & A. Pang, " Exploratory mining and pruning optimizations of constrained associations rules," in ACM SIGMOD 1998, pp. 13-24.
-
(1998)
ACM SIGMOD
, pp. 13-24
-
-
Ng, R.T.1
Lakshmanan, L.V.S.2
Han, J.3
Pang, A.4
-
20
-
-
84885993411
-
Online association rule mining over fast data
-
E. Olmezogullari & I. Ari, " Online association rule mining over fast data," in IEEE Big Data Congress 2013, pp. 110-117.
-
(2013)
IEEE Big Data Congress
, pp. 110-117
-
-
Olmezogullari, E.1
Ari, I.2
-
21
-
-
84871059721
-
Parma: A parallel randomized algorithm for approximate association rules mining in mapreduce
-
M. Riondato, J. DeBrabant, R. Fonseca, & E. Upfal, " PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce," in ACM CIKM 2012, pp. 85-94.
-
(2012)
ACM CIKM
, pp. 85-94
-
-
Riondato, M.1
Debrabant, J.2
Fonseca, R.3
Upfal, E.4
-
22
-
-
84873197622
-
Mining frequent itemsets over uncertain databases
-
July
-
Y. Tong, L. Chen, Y. Cheng, & P.S. Yu, " Mining frequent itemsets over uncertain databases," PVLDB, 5(11): 1650-1661, July 2012.
-
(2012)
PVLDB
, vol.5
, Issue.11
, pp. 1650-1661
-
-
Tong, Y.1
Chen, L.2
Cheng, Y.3
Yu, P.S.4
-
23
-
-
84886036088
-
Countering the concept-drift problem in big data using iovfdt
-
H. Yang & S. Fong, " Countering the concept-drift problem in big data using iOVFDT," in IEEE Big Data Congress 2013, pp. 126-132.
-
(2013)
IEEE Big Data Congress
, pp. 126-132
-
-
Yang, H.1
Fong, S.2
-
24
-
-
77951152387
-
Efficient dense structure mining using mapreduce
-
S. Yang, B. Wang, H. Zhao, & B. Wu, " Efficient dense structure mining using MapReduce," in IEEE ICDM Workshops 2009, pp. 332-337.
-
(2009)
IEEE ICDM Workshops
, pp. 332-337
-
-
Yang, S.1
Wang, B.2
Zhao, H.3
Wu, B.4
-
25
-
-
0033354342
-
Parallel and distributed association mining: A survey
-
Oct.-Dec
-
M.J. Zaki, " Parallel and distributed association mining: a survey," IEEE Concurrency, 7(4): 14-25, Oct.-Dec. 1999.
-
(1999)
IEEE Concurrency
, vol.7
, Issue.4
, pp. 14-25
-
-
Zaki, M.J.1
|