58 /342
為頻繁單變量不確定樣式產生摘要
58
315-344. doi: 10.1007/s10489-012-0415-3
. 2014. Mining maximal frequent patterns from univariate uncertain data.
Intelligent Data Analysis
, 18 (4): 653-676. doi: 10.3233/IDA-140662
Liu, Y. H., and Wang, C. S. 2013. Constrained frequent pattern mining on univariate
uncertain data.
Journal of Systems and Software
, 86 (3): 759-778. doi: 10.1016/
j.jss.2012.11.020
MacQueen, J. B. 1967. Some methods for classification and analysis of multivariate
observations. In Le Cam, L. M., and Neyman, J. (Eds.),
Proceedings of the Fifth
Berkeley Symposium on Mathematical Statistics and Probability: Statistics
(Vol.1)
: 281-297. Berkeley, CA: University of California Press.
Mimaroglu, S., and Simovici, D. A. 2007.
Clustering and approximate identification of
frequent item sets
. Paper presented at the Twentieth International Florida Artificial
Intelligence Research Society Conference, Key West, FL.
Muzammal, M. 2011. Mining sequential patterns from probabilistic databases by pattern-
growth. In Fernandes, A. A. A., Gray, A. J. G., and Belhajjame, K. (Eds.),
Lecture
Notes in Computer Science: Vol. 7051. Advances in Databases
: 118-127. Berlin,
Germany: Springer-Verlag. doi: 10.1007/978-3-642-24577-0_12
Muzammal, M., and Raman, R. 2010a. On probabilistic models for uncertain sequential
pattern mining. In Cao, L., Feng, Y., and Zhong, J. (Eds.),
Lecture Notes in
Computer Science: Vol. 6440. Advanced Data Mining and Applications
: 60-72.
Berlin, Germany: Springer-Verlag. doi: 10.1007/978-3-642-17316-5_6
. 2010b. Uncertainty in sequential pattern mining. In MacKinnon, L. M. (Ed.),
Proceedings of the 27th British National Conference on Data Security and
Security Data
: 147-150. Berlin, Germany: Springer-Verlag. doi: 10.1007/978-3-
642-25704-9_18
. 2011. Mining sequential patterns from probabilistic databases. In Huang, J. Z.,
Cao, L., and Srivastava, J. (Eds.),
Lecture Notes in Computer Science: Vol. 6635.
Advances in Knowledge Discovery and Data Mining
: 210-221. Berlin, Germany:
Springer-Verlag. doi: 10.1007/978-3-642-20847-8_18
Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999. Discovering frequent closed
itemsets for association rules. In Beeri, C., and Buneman, P. (Eds.),
Lecture Notes
in Computer Science: Vol. 1540. Database Theory–ICDT’99
: 398-416. Berlin,
Germany: Springer-Verlag.
Pei, J., Dong, G., Zou, W., and Han, J. 2002. On computing condensed frequent pattern