Discovering High Utility Change Points in Customer Transaction Data

  • Philippe Fournier-VigerEmail author
  • Yimin Zhang
  • Jerry Chun-Wei Lin
  • Yun Sing Koh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11323)


High Utility Itemset Mining (HUIM) consists of identifying all sets of items (itemsets) that have a high utility (e.g. have a high profit) in a database of customer transactions. Important limitations of traditional HUIM algorithms is that they do not consider that the utility of itemsets varies as time passes and that itemsets may not have a high utility in the whole database, but in some specific time periods. To overcome these drawbacks, this paper defines the novel problem of discovering change points of high utility itemsets, that is to find the time points where the utility of an itemset is changing considerably. An efficient algorithms named HUCP-Miner is proposed to mine these change points. Experimental results show that the proposed algorithm has excellent performance and can discover interesting patterns that are not identified by traditional HUIM algorithms.


Pattern mining High-utility itemsets Change points 


  1. 1.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Databases, pp. 487–499. Morgan Kaufmann, Santiago (1994)Google Scholar
  2. 2.
    Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Raś, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83–92. Springer, Cham (2014). Scholar
  3. 3.
    Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C., Tseng, V.S.: SPMF: a Java open-source pattern mining library. J. Mach. Learn. Res. (JMLR) 15, 3389–3393 (2014)zbMATHGoogle Scholar
  4. 4.
    Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: 22nd ACM International Conference on Information and Knowledge Management, pp. 55–64. ACM, Maui (2012)Google Scholar
  5. 5.
    Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689–695. Springer, Heidelberg (2005). Scholar
  6. 6.
    Tseng, V.S., Shie, B.-E., Wu, C.-W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)CrossRefGoogle Scholar
  7. 7.
    Peng, A.Y., Koh, Y.S., Riddle, P.: mHUIMiner: a fast high utility itemset mining algorithm for sparse datasets. In: Proceedings of 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 196–207. ACM (2017)CrossRefGoogle Scholar
  8. 8.
    Lin, J.C.W., Zhang, J., Fournier-Viger, P., Hong, T.P., Zhang, J.: A two-phase approach to mine short-period high-utility itemsets in transactional databases. Adv. Eng. Inform. 33, 29–43 (2017)CrossRefGoogle Scholar
  9. 9.
    Wan, Q., An, A.: Discovering transitional patterns and their significant milestones in transaction databases. IEEE Trans. Knowl. Data Eng. 21(12), 1692–1707 (2009)CrossRefGoogle Scholar
  10. 10.
    Ni, Y., Liao, Y.C., Huang, P.: MA trading rules, herding behaviors, and stock market overreaction. Int. Rev. Econ. Finan. 39, 253–265 (2015)CrossRefGoogle Scholar
  11. 11.
    Fournier-Viger, P., Zhang, Y., Lin, J.C.-W., Fujita, H., Koh, Y.S.: Mining local high utility itemsets. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R.R. (eds.) DEXA 2018. LNCS, vol. 11030, pp. 450–460. Springer, Cham (2018). Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Philippe Fournier-Viger
    • 1
    Email author
  • Yimin Zhang
    • 2
  • Jerry Chun-Wei Lin
    • 3
  • Yun Sing Koh
    • 4
  1. 1.School of Natural Sciences and HumanitiesHarbin Institute of Technology (Shenzhen)ShenzhenChina
  2. 2.School of Computer Sciences and TechnologyHarbin Institute of Technology (Shenzhen)ShenzhenChina
  3. 3.Department of Computing, Mathematics and PhysicsWestern Norway University of Applied Sciences (HVL)BergenNorway
  4. 4.Department of Computer SciencesUniversity of AucklandAucklandNew Zealand

Personalised recommendations