Post Mining of Non-redundant Association Rules for Sensor Data Estimation
Association mining can produce many association rules. It is widely recognized that the set of association rules can rapidly grow to be unwieldy, especially when the support requirements are relatively low, making it difficult for end users to identify those that are of particular interest to them. Therefore, it is important to remove insignificant rules and prune redundant information as well as utilize the discovered information for meaningful purposes in different applications. Many researchers have considered various kinds of solutions to the above problem. For example, to efficiently mine association rules based on frequent itemsets; to mine interesting association rules based on user-specified constraints; to mine non-redundant association rules. However, the number of produced association rules is still in a large amount and not all of them are useful for the end users requests. In this research we focus on post mining of nonredundant and informative association rules that match the user interests. The generated association rules are then applied to sensor network databases of a traffic monitoring site for missing data estimation purpose, in which data missing by a sensor is estimated using the data generated by its related sensors.
data mining non-redundant association rules wireless sensor network
Nan Jiang Zhiqiang Chen
Elmer W.Engstrom Department of Engineering and Computer Science, Cedarville University Cedarville, O School of Aerospace and Mechanical Engineering University of Oklahoma Norman, OK, U.S.A
国际会议
上海
英文
102-106
2010-06-22（万方平台首次上网日期，不代表论文的发表时间）