The Rapid Association Rules and Discovery of Tacit Knowledge Based on Star Schema
According to the shortcomings that data mining of the star schema structure is more complex, this paper planes a star schema structure, on base of these, an association rules mining algorithm is constructed. The algorithm first scans the fact table, produces maximum frequent set and association rules, and then the dimension table attributes are scanned quickly by link conditions and the local effectiveness principle of association rules, which of the dimension table is one-off production. The tacit knowledge is mined by constructing extended dimension table for the undefined association rules. The mining speed of the algorithm is faster and the extended hidden information can be found in this way.)
Star Schema Association Rules Tacit Knowledge Data mining
Zhang Chun-sheng Zhuang Li-yan
College of Computer Science and Technology Inner Mongolia University for Nationalities Tongliao China
国际会议
厦门
英文
300-302
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）