Database Reference
In-Depth Information
38. Leung, C.K.-S., & Jiang, F. 2011. Frequent pattern mining from time-fading streams of
uncertain data. In
Proceedings of the DaWaK 2011
, pages 252-264. Springer.
39. Leung, C.K.-S., & Tanbeer, S.K. 2012. Fast tree-based mining of frequent itemsets from
uncertain data. In
Proceedings of the DASFAA 2012, Part I
, pages 272-287. Springer.
40. Leung, C.K.-S., & Tanbeer, S.K. 2013. PUF-tree: a compact tree structure for frequent pattern
mining of uncertain data. In
Proceedings of the PAKDD 2013, Part I
, pages 13-25. Springer.
41. Leung, C.K.-S., Cuzzocrea, A., & Jiang, F. 2013. Discovering frequent patterns from uncertain
data streams with time-fading and landmark models.
LNCS Transactions on Large-Scale Data-
and Knowledge-Centered Systems
(
TLDKS
)
VIII
, pages 174-196. Springer.
42. Leung, C.K.-S., Mateo, M.A.F., & Brajczuk, D.A. 2008. A tree-based approach for frequent
pattern mining from uncertain data. In
Proceedings of the PAKDD 2008
, 653-661. Springer.
43. Leung, C.K.-S., Hao, B., & Brajczuk, D.A. 2010. Mining uncertain data for frequent itemsets
that satisfy aggregate constraints. In
Proceedings of the ACM SAC 2010
, pages 1034-1038.
44. Leung, C.K.-S., Tanbeer, S.K., Budhia, B.P., & Zacharias, L.C. 2012. Mining probabilistic
datasets vertically. In
Proceedings of the IDEAS 2012
, pages 199-204. ACM.
45. Madden, S. 2012. From databases to big data.
IEEE Internet Computing
, 16(3), pages 4-6.
46. Nadungodage, C.H., Xia, Y., Lee, J.J., & Tu, Y. 2013. Hyper-structure mining of frequent
patterns in uncertain data streams. In
Knowledge and Information Systems
(
KAIS
), 37(1),
pages 219-244. Springer.
47. Ren, J., Lee, S.D., Chen, X., Kao, B., Cheng, R., & Cheung, D. 2009. Naive Bayes classification
of uncertain data. In
Proceedings of the IEEE ICDM 2009
, pages 944-949.
48. Suciu, D. 2009. Probabilistic databases. In
Encyclopedia of Database Systems
, pages 2150-
2155. Springer.
49. Sun, L., Cheng, R., Cheung, D.W., & Cheng, J. 2010. Mining uncertain data with probabilistic
guarantees. In
Proceedings of the ACM KDD 2010
, pages 273-282.
50. Tong, Y., Chen, L., Cheng, Y., & Yu, P.S. 2012. Mining frequent itemsets over uncertain
databases. In
Proceedings of the VLDB Endowment
(
PVLDB
), 5(11), pages 1650-1661.
51. Wang, L., Cheng, R., Lee, S.D., & Cheung, D.W. 2010. Accelerating probabilistic frequent
itemset mining: a model-based approach. In
Proceedings of the ACM CIKM 2010
, pages
429-438.
52. Wasserkrug, S. 2009. Uncertainty in events. In
Encyclopedia of Database Systems
, pages
3221-3225. Springer.
53. Xu, L., & Hung, E. 2012. Improving classification accuracy on uncertain data by considering
multiple subclasses. In
Proceedings of the Australasian AI 2012
, pages 743-754. Springer.
54. Zaki, M.J. 1999. Parallel and distributed association mining: a survey.
IEEE Concurrency
,
7(4), pages 14-25.
55. Zaki, M.J., Parthasarathy, S., Ogihara, M., & Li, W. 1997. New algorithms for fast discovery
of association rules. In
Proceedings of the ACM KDD 1997
, pages 283-286.
56. Zhang, Q., Li, F., & Yi, K. 2008. Finding frequent items in probabilistic data. In
Proceedings
of the ACM SIGMOD 2008
, pages 819-832.