Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 8576829, 13 pages
https://doi.org/10.1155/2017/8576829
Research Article

PHUIMUS: A Potential High Utility Itemsets Mining Algorithm Based on Stream Data with Uncertainty

Air Force Engineering University, Xi’an, China

Correspondence should be addressed to Ju Wang; moc.kooltuo@ekujgnilgnoy

Received 8 October 2016; Revised 16 February 2017; Accepted 23 February 2017; Published 16 March 2017

Academic Editor: Haipeng Peng

Copyright © 2017 Ju Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Agrawal, T. Imielinski, and A. Swami, “Database mining: a performance perspective,” IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 6, pp. 914–925, 1993. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Han, J. Pei, Y. Yin, and R. Mao, “Mining frequent patterns without candidate generation: a frequent-pattern tree approach,” Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 53–87, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large database,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 207–216, Washington, DC, USA, 1993.
  4. R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499, Santiago, Chile, 1994.
  5. H. Yao, H. J. Hamilton, and C. J. Butz, “A foundational approach to mining itemset utilities from databases,” in Proceedings of the SIAM International Conference on Data Mining, pp. 211–225, 2004. View at MathSciNet
  6. R. Chan, Q. Yang, and Y.-D. Shen, “Mining high utility itemsets,” in Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM '03), pp. 19–26, Melbourne, Fla, USA, November 2003. View at Scopus
  7. Y. Liu, W. K. Liao, and A. Choudhary, “A two-phase algorithm for fast discovery of high utility itemsets,” in Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 689–695, Hanoi, Vietnam, May 2005.
  8. C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and Y.-K. Lee, “Efficient tree structures for high utility pattern mining in incremental databases,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 12, pp. 1708–1721, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. C.-W. Lin, T.-P. Hong, and W.-H. Lu, “An effective tree structure for mining high utility itemsets,” Expert Systems with Applications, vol. 38, no. 6, pp. 7419–7424, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. V. S. Tseng, B.-E. Shie, C.-W. Wu, and P. S. Yu, “Efficient algorithms for mining high utility itemsets from transactional databases,” IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 8, pp. 1772–1786, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Liu and J. Qu, “Mining high utility itemsets without candidate generation,” in Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM 12), pp. 55–64, November 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. J. C.-W. Lin, W. Gan, T.-P. Hong, and V. S. Tseng, “Efficient algorithms for mining up-to-date high-utility patterns,” Advanced Engineering Informatics, vol. 29, no. 3, pp. 648–661, 2015. View at Publisher · View at Google Scholar · View at Scopus
  13. V. S. Tseng, C. J. Chu, and T. Liang, “Efficient mining of temporal high utility itemsets from data streams,” in Proceedings of the ACM KDD Workshop on Utility-Based Data Mining Workshop, pp. 18–27, Chicago, Ill, USA, 2006.
  14. H.-F. Li, H.-Y. Huang, Y.-C. Chen, Y.-J. Liu, and S.-Y. Lee, “Fast and memory efficient mining of high utility itemsets in data streams,” in Proceedings of the 8th IEEE International Conference on Data Mining (ICDM '08), pp. 881–886, IEEE, Pisa, Italy, December 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. H.-F. Li, H.-Y. Huang, and S.-Y. Lee, “Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits,” Knowledge and Information Systems, vol. 28, no. 3, pp. 495–522, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. B.-E. Shie, P. S. Yu, and V. S. Tseng, “Efficient algorithms for mining maximal high utility itemsets from data streams with different models,” Expert Systems with Applications, vol. 39, no. 17, pp. 12947–12960, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and H.-J. Choi, “Interactive mining of high utility patterns over data streams,” Expert Systems with Applications, vol. 39, no. 15, pp. 11979–11991, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Zihayat and A. An, “Mining top-k high utility patterns over data streams,” Information Sciences, vol. 285, pp. 138–161, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. J. C.-W. Lin, W. Gan, P. Fournier-Viger, T.-P. Hong, and V. S. Tseng, “Efficient algorithms for mining high-utility itemsets in uncertain databases,” Knowledge-Based Systems, vol. 96, pp. 171–187, 2016. View at Publisher · View at Google Scholar · View at Scopus
  20. Y. Q. Lan, Y. Wang, Y. Wang, S. W. Yi, and D. Yu, “Mining high utility itemsets over uncertain databases,” in Proceedings of the 7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC '15), pp. 235–238, IEEE, Xi'an, China, September 2015. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Kannimuthu and K. Premalatha, “Discovery of high utility itemsets using genetic algorithm with ranked mutation,” Applied Artificial Intelligence, vol. 28, no. 4, pp. 337–359, 2014. View at Publisher · View at Google Scholar · View at Scopus
  22. J. C.-W. Lin, L. Yang, P. Fournier-Viger, T.-P. Hong, and M. Voznak, “A binary PSO approach to mine high-utility itemsets,” Soft Computing, vol. 3, pp. 1107–1135, 2016. View at Publisher · View at Google Scholar · View at Scopus
  23. C. K. Chui, B. Kao, and E. Hung, “Mining frequent itemsets from uncertain data,” in Proceedings of the Pacific-Asia Conference Advances in Knowledge Discovery and Data Mining, pp. 47–58, Nanjing, China, 2007.