Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: VLDB, Santiago, Chile, pp. 487–499 (1994)
Roberto, J., Bayardo, J., Agrawal, R.: Mining the Most Interesting Rules. In: ACM SIGKDD, New York, USA, pp. 145–154 (1999)
Omiecinski, E.R.: Alternative Interest Measures for Mining Associations in Databases. J. IEEE TKDE 15(1), 57–69 (2003)
Liu, B., Hsu, W., Chen, S., Ma, Y.: Analyzing the Subjective Interestingness of Association Rules. IEEE Intelligent Systems and their Applications 15, 47–55 (2000)
Pohle, C.: Integrating and Updating Domain Knowledge with Data Mining. In: VLDB PhD Workshop, Berlin, Germany (2003)
Shin, S., Lee, W.: An On-line Interactive Method for Finding Association Rules Data Streams. In: ACM CIKM, New York, USA, pp. 963–966 (2007)
Wang, K., Jiang, Y., Lakshmanan, L.: Mining Unexpected Rules by Pushing User Dynamics. In: ACM SIGKDD, New York, USA, pp. 246–255 (2003)
Xin, D., Shen, X., Mei, Q., Han, J.: Discovering Interesting Patterns through User’s Interactive Feedback. In: ACM SIGKDD, New York, USA, pp. 773–778 (2006)
Heath, C., Heath, D.: Made to Stick: Why Some Ideas Survive and Others Die. Random House, New York (2007)
Haviland, S., Clark, H.: What’s new? Acquiring new information as a process in comprehension. Journal of Verbal Learning & Verbal Behavior 13, 512–521 (1974)
Bauer, J.: Warum ich fühle was Du fühlst (2009)
Berlyne, D.: Structure and direction in thinking. Wiley, New York (1967)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM SIGMOD, Dallas, TX, USA, pp. 1–12 (2000)
Leung, C., Khan, Q.: DSTree: a Tree Structure for the Mining of Frequent Sets from Data Streams. In: IEEE ICDM, Hong Kong, China, pp. 928–932 (2006)
Lin, C.-H., Chiu, D.-Y., Wu, Y.-H., Chen, A.L.P.: Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window. In: SDM, Newport Beach, California, USA (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, G., Zhu, Yt., Chen, YC. (2011). Summarizing Association Itemsets by Pattern Interestingness in a Data Stream Environment. In: Chang, RS., Kim, Th., Peng, SL. (eds) Security-Enriched Urban Computing and Smart Grid. SUComS 2011. Communications in Computer and Information Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23948-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-23948-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23947-2
Online ISBN: 978-3-642-23948-9
eBook Packages: Computer ScienceComputer Science (R0)