Mining high utility itemsets
By R. Chan, Qiang Yang, Yi-Dong Shen. Third IEEE International Conference on Data Mining, 2003
550 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/9bd59ffc67f2f93aa4456380e8991de9171d3f5b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Vincent Shin-Mu Tseng
- Cheng-Wei Wu
- Chin-chen Chang
- Yu-Chiang Li
- Jieh-Shan Yeh
- Philip S. Yu
- Bai-En Shie
- Alok N. Choudhary
In Computational Theory and Mathematics
- Chin-chen Chang
- Yu-Chiang Li
- Jieh-Shan Yeh
- Vincent Shin-Mu Tseng
- Cheng-Wei Wu
- Howard J. Hamilton
- Philip S. Yu
- Bai-En Shie
In Information Systems
- Chin-chen Chang
- Yu-Chiang Li
- Jieh-Shan Yeh
- Vincent Shin-Mu Tseng
- Cheng-Wei Wu
- Howard J. Hamilton
- Philip S. Yu
- Bai-En Shie
Citations in the corpus
- A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets (2005, background): “A utility mining algorithm is proposed in [8], where the concept of “useful” is defined as an itemset that supports a specific objective that people want to achieve.”
- Choosing the Right Lens: Finding What is Interesting in Data Mining (2007, unknown): “Chan et al., 2003 [ 9 ]; Lu et al., 2001 [29]; Shen et al., 2002 [39]; Yao et al., 2004 [48]”
- A fast high utility itemsets mining algorithm (2005, background): “A utility mining algorithm is proposed in [14], where the concept of “useful” is defined as an itemset that supports a specific objective that people want to achieve.”
- A Foundational Approach to Mining Itemset Utilities from Databases (2004, background): “[3] recently described an alternate approach to mining high utility itemsets.”
- Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases (2009, unknown): “Then, the weight of itemset “ab” will be ð0:6þ 0:2Þ=2 ¼ 0:4 and its weighted frequency will be 0:4 3 ¼ 1:2.”
- Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases (2013, background): “Index Terms—Candidate pruning, frequent itemset, high utility itemset, utility mining, data mining Ç”
- UP-Growth: an efficient algorithm for high utility itemset mining (2010, background): “In view of this, utility mining [2, 3, 4, 6, 7, 8, 9, 10] emerges as an important topic in data mining for discovering the itemsets with high utility like profits.”
- Isolated items discarding strategy for discovering high utility itemsets (2008, background): “Recently, Yao et al. [36] attempted to build a unified framework for utility-based measures [11,27,28,32,34–36] that allows the user to select a suitable utility mining tool for a specific application; however, this framework only employs existing tools.”