An Boolean Algorithm for Discovering the Multi-level Characteristic Rule
碩士 === 立德管理學院 === 應用資訊研究所 === 94 === The relationship between goods in the database can be excavated by the association rules; if one can utilize this information properly, it can help users to discover implicit knowledge. There are a lot of methods existed as to how the association rules can be exc...
Main Authors: | Hsiang-Wen Yang, 楊翔雯 |
---|---|
Other Authors: | Cheng-Ming Yang |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/80728312194543894134 |
Similar Items
-
An Effective Boolean Algorithm for Discovering the Multiple-level Frequent Itemsets
by: Chi-Chun Wang, et al.
Published: (2003) -
A Frequent-Pattern tree Algorithm for Discovering the Multi-level Characteristic Rule
by: Wei-yun Hsieh, et al.
Published: (2007) -
A Frequent-Pattern tree Algorithm combine with Sequential Pattern for Discovering the Multi-level Characteristic Rule
by: Han-cheng Tsai, et al.
Published: (2010) -
An Association Rule Mining Algorithm Based on a Boolean Matrix
by: Hanbing Liu, et al.
Published: (2007-09-01) -
Discovering the Maximum Frequent Set Base on Boolean Method
by: Chin-Yu Hsieh, et al.
Published: (2003)