An Efficient Algorithm for Extracting High Utility Itemsets from Weblog Data

REFERENCES

• B. Liu, Web Data Mining, Berlin, Heidelberg: Springer, 2007, pp. 449–79.
   Google Scholar
• H. Xiong, P. Tan, and V. Kumar, “Hyperclique pattern discovery,” Data Mining Knowledge Discov, Vol. 13, pp. 219–42, May. 2006.
   Web of Science ®Google Scholar
• R. Agrawal, and R. Srikant, “Fast algorithms for mining association rules,” in Proceeding 20th VLDB Conference, San Francisco, 1994, pp. 487–99.
   Google Scholar
• R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases,” in Proceeding of the ACM SIGMOD Conference, New York, 1993, pp. 207–16.
   Google Scholar
• J. Wang, J. Han, Y. Lu, and P. Tzvetkov, “Algorithm for mining Top-K frequent closed itemsets,” IEEE Trans. Knowledge Data Eng., Vol. 17, pp. 652–64, May 2005.
   Web of Science ®Google Scholar
• R. Karim, C. F. Ahmed, B.Jeong, and H.Choi, “An efficient distributed programming model for mining useful patterns in big datasets,” IETE Tech. Rev., Vol. 30, pp. 53–63, Feb. 2013.
   Web of Science ®Google Scholar
• C.H. Cai, A.W.C. Fu, C.H.Cheng, and W.W. Kwong, “Mining association rules with weighted items,” in Proceedings of IEEE International Database Engineering and Applications Symposium, Cardiff, 1998, pp. 68–77.
   Google Scholar
• S. Yen, Y. Lee, C. Wang, C. Wu, and L. Ouyang, “The studies of mining frequent patterns based on frequent pattern tree,” in Proceeding of 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Heidelberg, 2009, pp. 232–41.
   Google Scholar
• K. Sun, and F. Bai, “Mining weighted association rules without preassigned weights,” IEEE Trans. Knowledge Data Eng., Vol. 20, pp. 489–95, Apr. 2008.
   Web of Science ®Google Scholar
• U. Yun, and J. J. Leggett, “WIP: Mining weighted interesting patterns with a strong weight and/or support affinity,” Inf. Sci., Vol. 177, pp. 3477–99, Sept. 2007.
   Web of Science ®Google Scholar
• R. Chan, Q. Yang, and Y. Shen, “Mining high utility itemsets,” in Proceedings of 3rd IEEE International Conference on Data Mining, Washington, 2003, pp. 19–26.
   Google Scholar
• B. Bakariya, K. K. Mohbey, and G. S. Thakur, “An inclusive survey on data preprocessing method used in web usage mining,” in Proceedings of 7th International Conference on Bio-Inspired Computing: Theories and Application, Gwalior, 2012, pp. 407–16.
   Google Scholar
• X. Zhu, J. Guo, X. Cheng, Y. Lan, and W. Nejdl, “Recommending high utility query via session-flow graph,” Adv. Inf. Retrieval, Vol. 7814, pp. 642–55, Mar. 2013.
   Google Scholar
• S. Shankar, T. Purusothaman, S. Jayanthi, and N. Babu, “A fast algorithm for mining high utility itemsets,” in Proceeding of IEEE International Advance Computing Conference, Patiala, 2009, pp. 1459–64.
   Google Scholar
• V. Tseng, B. Shie, C. Wu, and P. Yu, “Efficient algorithms for mining high utility itemsets from transactional databases,” IEEE Trans. Knowledge Data Eng., Vol. 25, pp. 1772–86, Aug. 2013.
   Web of Science ®Google Scholar
• J. Pillai, and. O. P. Vyas, “Overview of itemset utility mining and its applications,” International Journal of Computer Applications, Vol. 5, pp. 9–13, Aug. 2010.
   Google Scholar
• S. Yen, and Y. Lee, “Mining high utility quantitative association rules,” in Proceeding of 9th International Conference. Data Warehousing and Knowledge Discovery, Regensburg, 2007, pp. 283–92.
   Google Scholar
• B. Mallick, D. Garg, and P. Grover, “Constraint-based sequential pattern mining: A pattern growth algorithm incorporating compactness, length and monetary,” Int. Arab J. Inf. Technol., Vol. 11, pp. 33–42, May. 2014.
   Web of Science ®Google Scholar
• D. Guan, and W. Yuan, “A survey of mislabeled training data detection techniques for pattern classification,” IETE Tech. Rev., Vol. 30, pp. 524–30, Dec. 2013.
   Web of Science ®Google Scholar
• V. Dhanasekar, and T. Angamuthu, “An efficient approach for effectual mining of relational patterns from multi-relational database,” Int. Arab J. Inf. Technol., Vol. 10, pp. 260–8, May 2013.
   Web of Science ®Google Scholar
• B. Bakariya, and G. S. Thakur, “Effectuation of web log preprocessing and page access frequency using web usage mining,” Int. J. Comput. Sci. Eng., Vol. 1, pp. 1–5, Sept. 2013.
   Google Scholar
• J. Han, J. Pei, Y. Yin, and R. Mao, “Mining frequent patterns without candidate generation: a frequent-pattern tree approach,” Data Mining Knowledge Discov., Vol. 8, pp. 53–87, Jan. 2004.
   Web of Science ®Google Scholar
• A. Erwin, R. P. Gopalan, and N. R. Achuthan, “CTU-Mine: An efficient high utility itemset mining algorithm using the pattern growth approach,” in Proceeding of 7th IEEE International Conference on Computer and Information Technology, Fukushima, 2007, pp. 71–6.
   Google Scholar
• H. Xiong, S. Shekhar, P. Tan, and V. Kumar, “Exploiting a support based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs,” in Proceeding of 10th International Conference on Knowledge Discovery and Data Mining, New York, 2004, pp. 334–43.
   Google Scholar
• C. Ramaraju, and N. Savarimuthu, “A conditional tree based novel algorithm for high utility itemset mining,” in Proceeding of International Conference on Recent Trends in Information Technology, Chennai, 2011. pp. 701–6.
   Google Scholar
• M. Liu, and J. Qu, “Mining high utility itemsets without candidate generation,” in Proceeding of 21st ACM International Conference on Information and Knowledge Management, New York, 2012, pp. 55–64.
   Google Scholar
• C.F. Ahmed, S.K. Tanbeer, and J. Byeong-Soo, “Mining high utility web access sequences in dynamic web log data,” in Proceeding of 11th ACIS International Conference on Software Engineering Artificial Intelligence, Networking and Parallel/Distributed Computing, London, 2010, pp. 76–81.
   Google Scholar
• C. F Ahmed, S. K.Tanbeer, J. Byeong-Soo, and L. Young-Koo, “Efficient tree structures for high utility pattern mining in incremental databases,” IEEE Trans. Knowledge Data Eng., Vol. 21, pp. 1708–21, Dec. 2009.
   Web of Science ®Google Scholar
• P. Fournier-Viger, C. Wu, S. Zida, and V.S. Tseng, “FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning,” Foundations Intell. Syst., Vol. 8502, pp 83–92, Jun. 2014.
   Google Scholar
• J. Cao, Z. Wu, and J. Wu, “Up cosine interesting pattern discovery: A depth first method,” Int. J. Inf. Sci. Elsevier, Vol. 266, pp. 31–46, May 2014.
   Web of Science ®Google Scholar
• Weblog dataset downloaded from http://ita.ee.lbl.gov/html/contrib/NASA-HTTP.html Retrieved on March 12th, 2013.
   Google Scholar
• K.K. Mohbey, and G.S. Thakur, “Interesting user behaviour prediction in mobile e-commerce environment using constraints,” IETE Tech. Rev., doi:10.1080/02564602.2014.968224.
   Web of Science ®Google Scholar