Mining Fixed and Proportional Fault-Tolerant Frequent Patterns Efficiently by FT-association graph
碩士 === 國立東華大學 === 資訊工程學系 === 96 === Mining of frequent patterns in databases has been studied for several years. However, real-world data tends to be dirty and frequent pattern mining which extracts patterns that are absolutely matched is not enough. An approach, called fault-tolerant frequent patte...
Main Authors: | Jhih-Jie Zeng, 曾志傑 |
---|---|
Other Authors: | Guanling Lee |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/5wtajh |
Similar Items
-
Mining Semi-Frequent and Proportionally Fault-Tolerant Association Rule Algorithms and Applications
by: Chung-chieh Su, et al.
Published: (2006) -
Mining Fault-Tolerant Frequent Patterns in Large Databases
by: Sheng-Shun Wang, et al.
Published: (2002) -
An Efficient Algorithm for Proportionally Fault-tolerant Data Mining
by: Yu-tzu Lin, et al.
Published: (2004) -
Mining Frequent Patterns with the Frequent Pattern List
by: Fan-Chen Tseng, et al.
Published: (2002) -
An Efficient Approach for Mining Fault-Tolerant Frequent Itemsets based on Bit Sequences
by: Pei-Wy Yo, et al.
Published: (2004)