Mining association rules from imprecise ordinal data

Yen Liang Chen, Cheng Hsiung Weng

研究成果: 雜誌貢獻期刊論文同行評審

34 引文 斯高帕斯(Scopus)

摘要

Categorical data can generally be classified into ordinal data and nominal data. Although there have been numerous studies on finding association rules from nominal data, few have tried to do so from ordinal data. Additionally, previous mining algorithms usually assume that the input data is precise and clean, which is unrealistic in practical situations. Real-world data tends to be imprecise due to human errors, instrument errors, recording errors, and so on. Therefore, this paper proposes a new approach to discovering association rules from imprecise ordinal data. Experimental results from the survey data show the feasibility of the proposed mining algorithm. Performance analyses of the algorithms also show that the proposed approach can discover interesting and valuable rules that could never be found using the conventional approach, the Apriori algorithm.

原文???core.languages.en_GB???
頁(從 - 到)460-474
頁數15
期刊Fuzzy Sets and Systems
159
發行號4
DOIs
出版狀態已出版 - 16 2月 2008

指紋

深入研究「Mining association rules from imprecise ordinal data」主題。共同形成了獨特的指紋。

引用此