Mining hybrid sequential patterns by hierarchical mining technique

International Journal of Innovative Computing, Information and Control

Volumn 5, Issue 8, 2009, Pages 2351-2367

  Jea, Kuen Fang ^a   Lin, Ke Chung ^a   Liao, I En ^a  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Hierarchical mining technique; Hybrid sequential pattern; Mining

Indexed keywords

CANDIDATE PATTERNS; DATABASE TRANSACTIONS; DECOMPOSITION MODEL; HIERARCHICAL MINING TECHNIQUE; HYBRID SEQUENTIAL PATTERN; LARGE DATABASE; MARKETING STRATEGY; MINING ALGORITHMS; MINING TECHNIQUES; PATTERN DECOMPOSITION; SEQUENTIAL PATTERNS; TOP-DOWN MANNER; UNIQUE FEATURES; WEB PAGE;

DATABASE SYSTEMS; MARKETING; STRATEGIC PLANNING; WEBSITES;

MINING;

EID: 69949174752     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in large databases, Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 207-216, 1993.
2. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proc. of the 20th VLDB Conf., pp. 487-499, 1994.
3. R. Agrawal and R. Srikant, Mining sequential patterns, Proc. of the 11th International Conf. on Data Engineering, pp. 3-14, 1995.
4. R. Agrawal and R. Srikant, Mining sequential patterns: Generalizations and performance improvements, Proc. of the 5th International Conf. on Extending Database Technology, pp. 3-17, 1996.
5. Y. L. Chen, S. S. Chen and P. Y. Hsu, Mining hybrid sequential patterns and sequential rules, Information Systems, vol. 27, no. 5, pp. 345-362, 2002.
6. J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, Proc. of the ACM SIGMOD International Conf. on Management of Data, pp. 1-12, 2000.
7. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal and M.-C. Hsu, Freespan: Frequent pattern-projected sequential pattern mining, Proc. of International Conf. on Knowledge Discovery and Data Mining, pp. 355-359, 2000.
8. M.-Y. Lin and S.-Y. Lee, Fast dscovery of sequential patterns through memory indexing and database partitioning, Journal of Information Sciences and Engineering, vol. 21, no. 1, pp. 109-128, 2005.
9. D. Lin and Z. M. Kedem, Pincer-search: A new algorithm for discovering the maximum frequent set, IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 3, pp. 553-566, 2002.
10. J. S. Park, M. S. Chen and P. S. Yu, Using a hash-based method with transaction trimming for mining association rules, IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 5, pp. 813-825, 1997.
11. J. Pei, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, Q. Chen, U. Dayal and M.-C. Hsu, Mining sequential patterns by pattern-growth: The prefixspan approach, IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 11, pp. 1424-1440, 2004. (Pubitemid 40242330)
12. G. T. Raju, P. S. Satyanarayana and L. M. Patnaik, Knowledge discovery from web usage data: Extraction and applications of sequential and clustering patterns - A survey, International Journal of Innovative Computing, Information and Control, vol. 4, no. 2, pp. 381-389, 2008.
13. M. J. Zaki, SPADE: An efficient algorithm for mining frequent sequences, Machine Learning Journal, vol. 42, nos. 1/2, pp. 31-60, 2001.
14. http://researchweb.watson.ibm.com