In the age of Knowledge economy, people are paying more attention to data mining. However, the number of the mined association patterns often exceeds the capacity of human's mind. Therefore, it is necessary for effectively present patterns according to their interestingness. This approach focuses on continuously differentiating interesting and valuable patterns from data stream and proposes a new data structure, Pattern's Interestingness Tree (PI-Tree) for discovering frequent patterns and helping to distinguish interesting knowledge. Performance Analysis indicates that the proposed approach is efficient for IOKD. © 2011 Springer-Verlag.
CITATION STYLE
Lee, G., Zhu, Y. T., & Chen, Y. C. (2011). Summarizing association itemsets by pattern interestingness in a data stream environment. In Communications in Computer and Information Science (Vol. 223 CCIS, pp. 74–83). https://doi.org/10.1007/978-3-642-23948-9_10
Mendeley helps you to discover research relevant for your work.