:::

詳目顯示

回上一頁
題名:Generating Summaries for Frequent Univariate Uncertain Pattern
書刊名:臺大管理論叢
作者:劉英和
作者(外文):Liu, Ying-ho
出版日期:2017
卷期:27:2S
頁次:頁29-61
主題關鍵詞:巨量資料單變量不確定資料頻繁單變量不確定樣式摘要Big dataUnivariate uncertain dataFrequent univariate uncertain patternsSummary
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:3
在巨量資料的研究與應用裡,從中發現有用的知識是一個重要的主題。大部份關於這個主題的研究著眼於發展於巨量資料中擷取知識的方法,然而如何呈現所發現的知識仍是一個關鍵的議題。在文獻中,單變量不確定資料是一種巨量資料,並且從單變量不確定資料裡取出的頻繁單變量不確定樣式是一有用的知識。可是,頻繁單變量不確定樣式的數量通常都非常龐大而不易被人們利用,因此我們需要一個好的頻繁單變量不確定樣式的呈現方式。我們提出為頻繁單變量不確定樣式產生摘要的研究,其使用階層群集技術去產生摘要。人們只需檢視數十或數百個代表樣式,而不需處理大量的頻繁樣式。實驗顯示我們方法的摘要品質高於最大頻繁單變量不確定樣式所提供的摘要品質。
In big data related research and applications, discovery of useful knowledge from big data is an important topic. While most studies concerning this topic focus on developing methods for retrieving knowledge, presentation of the discovered knowledge remains a critical issue. A good method of presentation allows ordinary people to quickly understand and utilize the discovered knowledge. In the literature, univariate uncertain data is one kind of big data, and frequent patterns retrieved from univariate uncertain data, i.e., frequent univariate uncertain patterns, represent useful knowledge. However, the number of frequent univariate uncertain patterns is often too large to be dealt with by ordinary user. In other words, a good method of presenting the discovered frequent univariate uncertain patterns is required. To this end, we propose a novel way of summarizing frequent univariate uncertain patterns. We use a hierarchical clustering technique to generate a summary of a set of frequent univariate uncertain patterns. Instead of examining a large number of frequent univariate uncertain patterns, a user only needs to check tens, or perhaps hundreds, of representative frequent univariate uncertain patterns. Experimental results show that the summarization quality of our method is better than the summarization quality of maximum frequent univariate uncertain patterns.
期刊論文
1.Thabtah, F.(2007)。A review of associative classification mining。The Knowledge Engineering Review,22(1),37-65。  new window
2.Rousseeuw, Peter J.(1987)。Silhouettes: A graphical aid to the interpretation and validation of cluster analysis。Journal of Computational and Applied Mathematics,20,53-65。  new window
3.Abd-Elmegid, L. A.、El-Sharkawi, M. E.、El-Fangary, L. M.、Helmy, Y. K.(2010)。Vertical mining of frequent patterns from uncertain data。Computer and Information Science,3(2),171-179。  new window
4.Calders, T.、Goethals, B.(2007)。Non-derivable itemset mining。Data Mining and Knowledge Discovery,14(1),171-206。  new window
5.Hasan, M. A.、Salem, S.、Zaki, M. J.(2011)。SimClus: An effective algorithm for clustering with a lower bound on similarity。Knowledge and Information System,28(3),665-685。  new window
6.Kirsch, A.、Mitzenmacher, M.、Pietracaprina, A.、Pucci, G.、Upfal, E.、Vandin, F.(2009)。An efficient rigorous approach for identifying statistically significant frequent itemsets。Journal of the ACM,59(3),(12)1-(12)22。  new window
7.Lam, H. T.、Mörchen, F.、Fradkin, D.、Calders, T.(2014)。Mining compressing sequential patterns。Statistical Analysis and Data Mining,7(1),34-52。  new window
8.Liu, Y. H.(2012)。Mining frequent patterns from univariate uncertain data。Data & Knowledge Engineering,71(1),47-68。  new window
9.Liu, Y. H.(2013)。Stream mining on univariate uncertain data。Applied Intelligence,39(2),315-344。  new window
10.Liu, Y. H.(2014)。Mining maximal frequent patterns from univariate uncertain data。Intelligent Data Analysis,18(4),653-676。  new window
11.Liu, Y. H.、Wang, C. S.(2013)。Constrained frequent pattern mining on univariate uncertain data。Journal of Systems and Software,86(3),759-778。  new window
12.Vreeken, J.、van Leeuwen, M.、Siebes, A.(2011)。Krimp: Mining itemsets that compress。Data Mining and Knowledge Discovery,23(1),169-214。  new window
會議論文
1.Afrati, F.、Gionis, A.、Mannila, H.(2004)。Approximating a collection of frequent sets。The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。12-19。  new window
2.Aggarwal, C. C.、Li, Y.、Wang, Jianyong、Wang, Jing(2009)。Frequent pattern mining with uncertain data。The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。29-38。  new window
3.Bayardo, R. J. Jr.(1998)。Efficiently mining long patterns from databases。The 1998 ACM SIGMOD International Conference on Management of Data。New York, NY:Association for Computing Machinery。  new window
4.Han, J.、Wang, J.、Lu, Y.、Tzvetkov, P.(2002)。Mining top-k frequent closed patterns without minimum support。The 2002 IEEE International Conference on Data Mining。Washington, DC:Institute of Electrical and Electronics Engineers Computer Society。211-218。  new window
5.Jin, R.、Abu-Ata, M.、Xiang, Y.、Ruan, N.(2008)。Effective and efficient itemset pattern summarization: Regression-based approaches。The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。399-407。  new window
6.Jin, R.、Xiang, Y.、Hong, H.、Huang, K.(2010)。Block interaction: A generative summarization scheme for frequent patterns。The ACM SIGKDD Workshop on Useful Patterns。New York, NY:Association for Computing Machinery。55-64。  new window
7.Leung, C. K. S.、Carmichael, C. L.、Hao, B.(2007)。Efficient mining of frequent patterns from uncertain data。The Seventh IEEE International Conference on Data Mining Workshops。Omaha, NE。  new window
8.MacQueen, J. B.(1967)。Some methods for classification and analysis of multivariate observations。The Fifth Berkeley Symposium on Mathematical Statistics and Probability: Statistics。Berkeley, CA:University of California Press。281-297。  new window
9.Mimaroglu, S.、Simovici, D. A.(2007)。Clustering and approximate identification of frequent item sets。The Twentieth International Florida Artificial Intelligence Research Society Conference。Key West, FL。  new window
10.Muzammal, M.、Raman, R.(2010)。Uncertainty in sequential pattern mining。The 27th British National Conference on Data Security and Security Data。Berlin:Springer-Verlag。147-150。  new window
11.Pasquier, N.、Bastide, Y.、Taouil, R.、Lakhal, L.(1999)。Discovering frequent closed itemsets for association rules。ICDT'99。Berlin:Springer-Verlag。398-416。  new window
12.Pei, J.、Dong, G.、Zou, W.、Han, J.(2002)。On computing condensed frequent pattern bases。The 2002 IEEE International Conference on Data Mining。New York, NY:Institute of Electrical and Electronics Engineers。378-385。  new window
13.Siebes, A.、Vreeken, J.、van Leeuwen, M.(2006)。Item sets that compress。The 2006 SIAM International Conference on Data Mining。Philadelphia, PA:Society for Industrial and Applied Mathematics。395-406。  new window
14.Sun, L.、Cheng, R.、Cheung, D. W.、Cheng, J.(2010)。Mining uncertain data with probabilistic guarantees。The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。273-282。  new window
15.Tatti, N.、Vreeken, J.(2012)。The long and the short of it: Summarising event sequences with serial episodes。The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。462-470。  new window
16.Wang, H.、Wang, W.、Yang, J.、Yu, P. S.(2002)。Clustering by pattern similarity in large data sets。The 2002 ACM SIGMOD International Conference on Management of Data。New York, NY:Association for Computing Machinery。394-405。  new window
17.Wang, T.(2008)。Compressing the set of frequent sequential patterns。The Fifth International Conference on Fuzzy Systems and Knowledge Discovery。Jinan。  new window
18.Xin, D.、Cheng, H.、Yan, X.、Han, J.(2006)。Extracting redundancy-aware top-k patterns。The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。444-453。  new window
19.Xin, D.、Han, J.、Yan, X.、Cheng, H.(2005)。Mining compressed frequent-pattern sets。The 31st International Conference on Very Large Data Bases。Trondheim:Very Large Data Base Endowment。709-720。  new window
20.Yan, X.、Cheng, H.、Han, J.、Xin, D.(2005)。Summarizing itemset patterns: A profilebased approach。The Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining。New York, NY:Association for Computing Machinery。314-323。  new window
21.Yang, C.、Fayyad, U.、Bradley, P. S.(2001)。Efficient discovery of error-tolerant frequent itemsets in high dimensions。The Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。New York, NY:Association for Computing Machinery。194-203。  new window
圖書
1.Han, J.、Kamber, M.、Pei, J.(2011)。Data mining: concepts and techniques。Morgan Kaufmann。  new window
其他
1.Environmental Protection Administration(2015)。Air quality annual report of R.O.C. (Taiwan),http://taqm.epa.gov.tw/taqm/en/YearlyDataDownload.aspx。  new window
圖書論文
1.Chui, C. K.、Kao, B.(2008)。A decremental approach for mining frequent itemsets from uncertain data。Advances in Knowledge Discovery and Data Mining。Berlin:Springer-Verlag。  new window
2.Chui, C. K.、Kao, B.、Hung, E.(2007)。Mining frequent itemsets from uncertain data。Advances in Knowledge Discovery and Data Mining。Berlin:Springer-Verlag。  new window
3.Laney, Doug(2001)。3D data management: Controlling data volume, velocity, and variety。Application Delivery Strategies。Stanford, CT:META Group。  new window
4.Leung, C. K. S.、Mateo, M. A. F.、Brajczuk, D. A.(2008)。A tree-based approach for frequent pattern mining from uncertain data。Advances in Knowledge Discovery and Data Mining。Berlin:Springer-Verlag。  new window
5.Muzammal, M.(2011)。Mining sequential patterns from probabilistic databases by patterngrowth。Advances in Databases。Berlin:Springer-Verlag。  new window
6.Muzammal, M.、Raman, R.(2010)。On probabilistic models for uncertain sequential pattern mining。Advanced Data Mining and Applications。Berlin:Springer-Verlag。  new window
7.Muzammal, M.、Raman, R.(2011)。Mining sequential patterns from probabilistic databases。Advances in Knowledge Discovery and Data Mining。Berlin:Springer-Verlag。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top