Sequential mining methods efficiently discover all frequent sequential patterns included in sequential data. These methods use the support, which is the previous criterion that satisfies the Apriori property, to evaluate the frequency. However, the discovered patterns do not always correspond to the interests of analysts, because the patterns are common and the analysts cannot get new knowledge from the patterns. The paper proposes a new criterion, namely, the sequential interestingness, to discover sequential patterns that are more attractive for the analysts. The paper shows that the criterion satisfies the Apriori property and how the criterion is related to the support. Also, the paper proposes an efficient sequential mining method based on the proposed criterion. Lastly, the paper shows the effectiveness of the proposed method by applying the method to two kinds of sequential data.<\/p>\r\n","references":"[1] R. Agrawal and R. Srikant, \"Fast Algorithms for Mining Association\r\nRules,\" in Proc. of the 20th Int. Conf. Very Large Data Bases, 1994,\r\nSantiago de Chile, Chile, pp. 487-499.\r\n[2] R. Agrawal and R. Srikant, \"Mining Sequential Patterns,\" in Proc. of the\r\n11th Int. Conf. Data Engineering, 1995, Taipei, Taiwan, pp. 3-14.\r\n[3] J. Ayres, J. E. Gehrke, T. Yiu, and J. Flannick, \"Sequential PAttern Mining\r\nUsing Bitmaps,\" In Proc. of the 8th Int. Conf. on Knowledge Discovery\r\nand Data Mining, 2002, Edmonton, Alberta, Canada, pp. 429-435.\r\n[4] J. Blanchard, F. Guillet, H. Briand, and R. Gras, \"Assessing Rule Interestingness\r\nwith a Probabilistic Measure of Deviation from Equilibrium,\"\r\nin Proc. of the 11th Int. Sympo. on Applied Stochastic Models and Data\r\nAnalysis, 2005, Brest, France, pp. 191-200.\r\n[5] S. Brin, R. Motwani, and C. Silverstein, \"Beyond Market Baskets: Generalizing\r\nAssociation Rules to Correlations,\" in Proc. of the 1997 ACM\r\nSIGMOD Int. Conf. on Management of Data, 1997, Tucson, Arizona,\r\nUSA, pp. 265-276.\r\n[6] M. N. Garofalakis, R. Rastogi, and K. Shim, \"SPIRIT: Sequential Pattern\r\nMining with Regular Expression Constraints,\" in Proc. of the Very Large\r\nData Bases Conf., 1999, Edinburgh, Scotland, UK, pp. 223-234.\r\n[7] L. Geng and H. J. Hamilton, \"Interestingness measures for data mining:\r\nA survey,\" ACM Computing Surveys, vol. 38, no. 3, article 9, 2006.\r\n[8] Y. Ichimura, Y. Nakayama, M. Miyoshi, T. Akahane, T. Sekiguchi,\r\nY. Fujiwara, \"Text Mining System for Analysis of a Salesperson-s Daily\r\nReports,\" in Proc. of Pacific Association for Computational Linguistics\r\n2001, 2001, Kitakyushu, Japan, pp. 127-135.\r\n[9] V. Lavrenko, M. Schmill, D. Lawrie, P. Ogilvie, D. Jensen, J. Allan,\r\n\"Mining of Concurrent Text and Time-Series,\" in Proc. of the KDD-2000\r\nWorkshop on Text Mining, 2000, Boston, Massachusetts, USA, pp. 37-44.\r\n[10] B. Lent, R. Agrawal, R. Srikant, \"Discovering Trends in Text Databases,\"\r\nin Proc. of the 3rd Int. Conf. on Knowledge Discovery and Data Mining,\r\n1997, Newport Beach, California, USA, pp. 227-230.\r\n[11] K. McGarry, \"A Survey of Interestingness Measures for Knowledge\r\nDiscovery,\" the Knowledge Engineering Review, vol. 20, no. 1, pp.39-\r\n61, 2005.\r\n[12] J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M. Hsu,\r\n\"PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected\r\nPattern Growth,\" in Proc. of the 2001 Int. Conf. Data Engineering, 2001,\r\nHeidelberg, Germany, pp. 215-224.\r\n[13] J. Pei, J. Han, W. Wang, \"Mining Sequential Patterns with Constraints\r\nin Large Databases,\" in Proc. of the 11th ACM Int. Conf. on Information\r\nand Knowledge Management, 2002, McLean, Virginia, USA, pp. 18-25.\r\n[14] S. Sakurai, K. Ueno, R. Orihara, \"Discovery of Time Series Event\r\nPatterns based on Time Constraints from Textual Data,\" Int. J. of\r\nComputational Intelligence, vol. 4, no. 2, pp. 144-151, 2008.\r\n[15] K. Shimazu, A. Momma, and K. Furukawa, \"Discovering Exceptional\r\nInformation from Customer Inquiry by Association Rule Miner,\" in Proc.\r\nof the 6th Int. Conf. on Discovery Science 2003, 2003, Sapporo, Japan,\r\npp. 269-282.\r\n[16] A. Silberschatz and A. Tuzhilin, \"What Makes Patterns Interesting in\r\nKnowledge Discovery Systems,\" IEEE Trans. on Knowledge and Data\r\nEngineering, vol. 8, no. 6, pp. 970-974, Dec., 1996.\r\n[17] R. Srikant and R. Agrawal, \"Mining Sequential Patterns: Generalizations\r\nand Performance Improvements,\" in Proc. of the 5th Int. Conf. Extending\r\nDatabase Technology, 1996, Avignon, France, pp. 3-17.\r\n[18] E. Suzuki and J. M. Zytkow, \"Unified Algorithm for Undirected Discovery\r\nof Exception Rules,\" Int. J. of Intelligent Systems, vol. 20, no. 7,\r\npp. 673-691, July, 2005.\r\n[19] R. Swan and D. Jensen, \"TimeMines: Constructing Timelines with\r\nStatistical Models of Word Usage,\" in Proc. of the KDD-2000 Workshop\r\non Text Mining, 2000, Boston, Massachusetts, USA, pp. 73-80.\r\n[20] S. -J. Yen, \"Mining Interesting Sequential Patterns for Intelligent Systems,\"\r\nInt. J. of Intelligent Systems, vol. 20, no. 1 , pp 73-87, Jan., 2005.\r\n[21] M. J. Zaki, \"Sequence Mining in Categorical Domains: Algorithms\r\nand Applications,\" in Sequence Learning: Paradigms, Algorithms, and\r\nApplications, Lecture Notes in Computer Science, vol. 1828, pp. 162-\r\n187, 2001.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 23, 2008"}