Yi Du
Abstract
Previous algorithms on mining association rules maintain that the importance of each item in database is equal. This paper presents a method of mining weighted association rules in database, which can solve the problems caused by the unequal importance of the items.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Previous algorithms on mining association rules maintain that the importance of each item in database is equal. This paper presents a method of mining weighted association rules in database, which can solve the problems caused by the unequal importance of the items.
Key concepts: Association rule learning, Data mining, Database, Computer science, Association (psychology), Apriori algorithm, Algorithm, Epistemology