ABSTRACT
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considered very significant if its actual occurrence frequency exceeds the prior expectation by a large margin. The traditional metric, such as support, is not necessarily the ideal model to measure this kind of surprising patterns because it treats all patterns equally in the sense that every occurrence carries the same weight towards the assessment of the significance of a pattern regardless of the probability of occurrence. A more suitable measurement, information, is introduced to naturally value the degree of surprise of each occurrence of a pattern as a continuous and monotonically decreasing function of its probability of occurrence. This would allow patterns with vastly different occurrence probabilities to be handled seamlessly. As the accumulated degree of surprise of all repetitions of a pattern, the concept of information gain is proposed to measure the overall degree of surprise of the pattern within a data sequence. The bounded information gain property is identified to tackle the predicament caused by the violation of the downward closure property by the information gain measure and in turn provides an efficient solution to this problem. Empirical tests demonstrate the efficiency and the usefulness of the proposed model.
- 1.G. Berger and A. Tuzhilin. Discovering unexpected patterns in temporal data using temporal logic. Temporal Databases - Research and Practice, Lecture Notes on Computer Sciences, (1399) 281-309, 1998.Google ScholarCross Ref
- 2.R. Blahut. Principles and Practice of Information Theory, Addison-Wesley Publishing Company, 1987. Google ScholarDigital Library
- 3.S. Brin, R. Motwani, C. Silverstein. Beyond market baskets: generalizing association rules to correlations. Proc. ACM SIGMOD Conf. on Management of Data, 265-276, 1997. Google ScholarDigital Library
- 4.J. Han, G. Dong, and Y. Yin. Efficient mining partial periodic patterns in time series database. Proc. Int. Conf. on Data Engineering, 106-115, 1999. Google ScholarDigital Library
- 5.M. Klemetinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. Verkamo. Finding interesting rules from large sets of discovered association rules. Proe. CIKM, 1994. Google ScholarDigital Library
- 6.B. Liu, W. Hsu, and Y. Ma. Mining association Rules with multiple minimum supports. Proc. ACM SIGKDD, 337-341, 1999. Google ScholarDigital Library
- 7.S. Ma and J. Hellerstein. Mining partially periodic event patterns with unknown periods. Proe. Int. Conf. on Data Engineering, 205-214, 2001. Google ScholarDigital Library
- 8.H. Mannila, D. Pavlov, and P. Smyth. Prediction with local patterns using cross-entropy. Proe. ACId SIGKDD, 357-361, 1999. Google ScholarDigital Library
- 9.T. Oates, M. D. Schmill, P. R. Cohen. Efficient mining of statistical dependencies. Proc. 16th Int. Joint Conf. on Artificial Intelligence, 794-799, 1999. Google ScholarDigital Library
- 10.B. Padmanabhan and A. Tuzhilin. Small is beautiful: discovering the minimal set of unexpected patterns. Proc. ACM KDD, 54-63, 2000. Google ScholarDigital Library
- 11.A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discover systems. IEEE Transactions on Knowledge and Data Engineerin 9 (TKDE) vol. 8 no. 6, pp. 970-974, 1996. Google ScholarDigital Library
- 12.K. Wang, Y. He, and J. Han. Mining frequent itemsets using support constraints. Proe. Int. Conf. on Very Large Data Bases, 2000. Google ScholarDigital Library
- 13.J. Yang, W. Wang, and P. Yu. Mining asynchronous periodic patterns in time series data. Proe. ACM SIGKDD Int. Conf. on Knowled9 e Discovery and Data Mining (SIGKDD), pp. 275-279, 2000. Google ScholarDigital Library
- 14.J. Yang, W. Wang, and P. Yu. InfoMiner: mining surprising periodic patterns. IBM Research Report, 2001.Google ScholarDigital Library
- 15.M. J. Zaki. Generating non-redundant association rules. Proe. ACM SIGKDD, 34-43, 2000. Google ScholarDigital Library
Index Terms
- Infominer: mining surprising periodic patterns
Recommendations
InfoMiner+: Mining Partial Periodic Patterns with Gap Penalties
ICDM '02: Proceedings of the 2002 IEEE International Conference on Data MiningIn this paper, we focus on mining periodic patterns allowing some degreeof imperfection in the form of random replacement from a perfectperiodic pattern. Information gain was proposed to identify patternswith events of vastly different occurrence ...
Frugal bribery in voting
Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $Bribery problem, namely, Frugal-bribery and Frugal-$bribery where the briber is frugal in nature. By ...
An Experiment in Approval Voting
The first major experimental comparison of approval voting with regular plurality voting occurred in the 1985 annual election of The Institute of Management Sciences TIMS. In approval voting a person votes for approves of as many candidates as desired, ...
Comments