The DOI matches its Crossref record; 93 of the 93 references it cites were found in a registry or an index.
A Survey of Utility-Oriented Pattern Mining
Open accessAbstract
The main purpose of data mining and analytics is to find novel, potentially useful patterns that can be utilized in real-world applications to derive beneficial knowledge. For identifying and evaluating the usefulness of different kinds of patterns, many techniques and constraints have been proposed, such as support, confidence, sequence order, and utility parameters (e.g., weight, price, profit, quantity, satisfaction, etc.). In recent years, there has been an increasing demand for utility-oriented pattern mining (UPM, or called utility mining). UPM is a vital task, with numerous high-impact applications, including cross-marketing, e-commerce, finance, medical, and biomedical applications. This survey aims to provide a general, comprehensive, and structured overview of the state-of-the-art methods of UPM. First, we introduce an in-depth understanding of UPM, including concepts, examples, and comparisons with related concepts. A taxonomy of the most common and state-of-the-art approaches for mining different kinds of high-utility patterns is presented in detail, including Apriori-based, tree-based, projection-based, vertical-/horizontal-data-format-based, and other hybrid approaches. A comprehensive review of advanced topics of existing high-utility pattern mining techniques is offered, with a discussion of their pros and cons. Finally, we present several well-known open-source software packages for UPM. We conclude our survey with a discussion on open and practical challenges in this field.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Internet of Things: A survey
Atzori, L., Iera, A., & Morabito, G. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.05.010 · Cited by 15,613
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Han, J., Pei, J., Yin, Y., & Mao, R. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000005258.31418.83 · Cited by 2,629
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Self-citationPrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2005) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914830 · Cited by 1,791
MapReduce: a flexible data processing tool
Dean, J., & Ghemawat, S. (2010) · Communications of the ACM · doi:10.1145/1629175.1629198 · Cited by 1,182
Interestingness measures for data mining: A survey
Geng, L., & Hamilton, H. J. (2006) · ACM Computing Surveys · doi:10.1145/1132960.1132963 · Cited by 1,141
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Issues in data stream management
Golab, L., & ÖZSU, M. T. (2003) · ACM SIGMOD Record · doi:10.1145/776985.776986 · Cited by 964
Approximate Frequency Counts over Data Streams
Manku, G. S., & Motwani, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50038-x · Cited by 941
Levelwise Search and Borders of Theories in Knowledge Discovery
Mannila, H., & Toivonen, H. T. T. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009796218281 · Cited by 889
Maintenance of discovered association rules in large databases: an incremental updating technique
Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492094 · Cited by 800
Efficient mining of association rules using closed itemset lattices
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Information Systems · doi:10.1016/s0306-4379(99)00003-4 · Cited by 768
Data Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620 · cited 1×
“Mining interesting patterns from different types of data is quite important in many real-life applications [1], [3], [4], [5], [6].”
BackgroundEfficient Tree Structures for High Utility Pattern Mining in Incremental Databases
Ahmed, C. F., Tanbeer, S. K., Jeong, B.-S., & Lee, Y.-K. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.46 · Cited by 583
Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases
Tseng, V. S., Shie, B.-E., Wu, C.-W., & Yu, P. S. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.59 · Cited by 570
Self-citationA Foundational Approach to Mining Itemset Utilities from Databases
Yao, H., Hamilton, H. J., & Butz, C. J. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.51 · Cited by 569
Selecting the right objective measure for association analysis
Tan, P.-N., Kumar, V., & Srivastava, J. (2004) · Information Systems · doi:10.1016/s0306-4379(03)00072-3 · Cited by 568
The SPMF Open-Source Data Mining Library Version 2
Fournier-Viger, P., Lin, J. C.-W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z., & Lam, H. T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46131-1_8 · Cited by 549
Self-citationA General Survey of Privacy-Preserving Data Mining Models and Algorithms
Aggarwal, C. C., & Yu, P. S. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_2 · Cited by 469
Self-citationUP-Growth: an efficient algorithm for high utility itemset mining
Tseng, V. S., Wu, C.-W., Shie, B.-E., & Yu, P. S. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835839 · Cited by 442
Self-citationChan, R., Yang, Q., & Shen, Y.-D. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250893 · Cited by 405
Efficiently mining maximal frequent itemsets
Gouda, K., & Zaki, M. J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989514 · Cited by 397
Mining itemset utilities from transaction databases
Yao, H., & Hamilton, H. J. (2005) · Data & Knowledge Engineering · doi:10.1016/j.datak.2005.10.004 · Cited by 371
A General Incremental Technique for Maintaining Discovered Association Rules
Cheung, D. W., Lee, S. D., & Kao, B. (1997) · Database Systems for Advanced Applications '97 · doi:10.1142/9789812819536_0020 · Cited by 371
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
Differentially Private Data Publishing and Analysis: A Survey
Zhu, T., Li, G., Zhou, W., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2697856 · Cited by 330
Self-citationA survey of interestingness measures for knowledge discovery
MCGARRY, K. (2005) · The Knowledge Engineering Review · doi:10.1017/s0269888905000408 · Cited by 318
Frequent pattern mining with uncertain data
Aggarwal, C. C., Li, Y., Wang, J., & Wang, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557030 · Cited by 297
Mining All Non-derivable Frequent Itemsets
Calders, T., & Goethals, B. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45681-3_7 · Cited by 295
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
Hong, S., Oguntebi, T., & Olukotun, K. (2011) · 2011 International Conference on Parallel Architectures and Compilation Techniques · doi:10.1109/pact.2011.14 · Cited by 269
Isolated items discarding strategy for discovering high utility itemsets
Li, Y.-C., Yeh, J.-S., & Chang, C.-C. (2008) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.06.009 · Cited by 267
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Boulicaut, J., Bykowski, A., & Rigotti, C. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1021571501451 · Cited by 267
An effective tree structure for mining high utility itemsets
Lin, C.-W., Hong, T.-P., & Lu, W.-H. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.12.082 · Cited by 238
Fournier‐Viger, P., Lin, J. C., Vo, B., Chi, T. T., Zhang, J., & Le, H. B. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1207 · Cited by 237
Self-citationEfficient mining of weighted association rules (WAR)
Wang, W., Yang, J., & Yu, P. S. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347149 · Cited by 233
Self-citationA Survey of Parallel Sequential Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., & Yu, P. S. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3314107 · Cited by 219
Self-citationDirect Discovery of High Utility Itemsets without Candidate Generation
Liu, J., Wang, K., & Fung, B. C. M. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.20 · Cited by 179
Data mining in distributed environment: a survey
Gan, W., Lin, J. C., Chao, H., & Zhan, J. Z. (2017) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1216 · Cited by 177
Self-citationHUOPM: High-Utility Occupancy Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., & Yu, P. S. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2896267 · Cited by 162
Self-citationMaximum entropy models and subjective interestingness: an application to tiles in binary databases
Bie, T. D. (2010) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0209-3 · Cited by 156
A survey of incremental high‐utility itemset mining
Gan, W., Lin, J. C., Fournier‐Viger, P., Chao, H., Hong, T., & Fujita, H. (2018) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1242 · Cited by 156
Self-citationA new incremental data mining algorithm using pre-large itemsets1
Hong, T., Wang, C.-Y., & Tao, Y. (2001) · Intelligent Data Analysis · doi:10.3233/ida-2001-5203 · Cited by 153
Domain-Driven Data Mining: Challenges and Prospects
Cao, L. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.32 · Cited by 153
Mining top-K high utility itemsets
Wu, C. W., Shie, B.-E., Tseng, V. S. M., & Yu, P. S. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339546 · Cited by 149
Self-citationCMRules: Mining sequential rules common to several sequences
Fournier‐Viger, P., Faghihi, U., Nkambou, R., & Nguifo, E. M. (2011) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.07.005 · Cited by 137
Self-citationMining Weighted Association Rules without Preassigned Weights
Sun, K., & Bai, F. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190723 · Cited by 132
On efficiently mining high utility sequential patterns
Wang, J.-Z., Huang, J., & Chen, Y. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-015-0914-8 · Cited by 128
Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility Itemsets
Tseng, V. S. M., Wu, C., Fournier‐Viger, P., & Yu, P. S. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2345377 · Cited by 126
Self-citationIndex-BitTableFI: An improved algorithm for mining frequent itemsets
Song, W. G., Yang, B., & Xu, Z. (2008) · Knowledge-Based Systems · doi:10.1016/j.knosys.2008.03.011 · Cited by 125
Applying the maximum utility measure in high utility sequential pattern mining
Lan, G.-C., Hong, T., Tseng, V. S. M., & Wang, S.-L. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.02.022 · Cited by 116
Self-citationEfficient Mining of High Utility Itemsets from Large Datasets
Erwin, A., Gopalan, R. P., & Achuthan, N. R. (2008) · Springer eBooks · doi:10.1007/978-3-540-68125-0_50 · Cited by 114
Effective utility mining with the measure of average utility
Hong, T., Lee, C.-H., & Wang, S.-L. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.01.006 · Cited by 114
Efficient algorithms for mining high-utility itemsets in uncertain databases
Lin, J. C., Gan, W., Fournier‐Viger, P., Hong, T., & Tseng, V. S. M. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.12.019 · Cited by 113
Self-citationMining high utility episodes in complex event sequences
Wu, C., Lin, Y.-F. F., Yu, P. S., & Tseng, V. S. M. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487654 · Cited by 109
Self-citationAn efficient algorithm to mine high average-utility itemsets
Lin, J. C., Li, T., Fournier‐Viger, P., Hong, T., Zhan, J. Z., & Vozn̆ák, M. (2016) · Advanced Engineering Informatics · doi:10.1016/j.aei.2016.04.002 · Cited by 107
Self-citationAn incremental mining algorithm for high utility itemsets
Lin, J. C., Lan, G.-C., & Hong, T. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.01.072 · Cited by 106
Self-citationHigh-utility pattern mining: A method for discovery of high-utility item sets
Hu, J., & Mojsilović, A. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.02.003 · Cited by 102
CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction
Alkan, Ö., & Karagöz, P. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2420557 · Cited by 99
Mining High Utility Mobile Sequential Patterns in Mobile Commerce Environments
Shie, B.-E., Hsiao, H.-F., Tseng, V. S., & Yu, P. S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20149-3_18 · Cited by 97
Self-citationCTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach
Erwin, A., Gopalan, R. P., & Achuthan, N. R. (2007) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2007.120 · Cited by 97
An efficient algorithm for mining temporal high utility itemsets from data streams
Chu, C., Tseng, V. S. M., & Liang, T. (2007) · Journal of Systems and Software · doi:10.1016/j.jss.2007.07.026 · Cited by 95
Self-citationYun, U., Ryang, H., Lee, G., & Fujita, H. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.03.016 · Cited by 93
Mining top-k high utility patterns over data streams
Zihayat, M., & An, A. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.045 · Cited by 89
An efficient approach for mining association rules from high utility itemsets
Sahoo, J., Das, A. K., & Goswami, A. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.02.051 · Cited by 83
Shie, B.-E., Yu, P. S., & Tseng, V. S. M. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.05.035 · Cited by 81
Self-citationMining High Utility Itemsets in Big Data
Lin, Y. C., Wu, C.-W., & Tseng, V. S. M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18032-8_51 · Cited by 78
Self-citationPrivacy Preserving Utility Mining: A Survey
Gan, W., Chun-Wei, J., Chao, H., Wang, S.-L., & Yu, P. S. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8622405 · Cited by 76
Self-citationA fast perturbation algorithm using tree structure for privacy preserving utility mining
Yun, U., & Kim, J. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.08.037 · Cited by 72
Mining closed+ high utility itemsets without candidate generation
Wu, C., Fournier‐Viger, P., Gu, J., & Tseng, V. S. M. (2015) · Conference on Technologies and Applications of Artificial Intelligence (TAAI) · doi:10.1109/taai.2015.7407089 · Cited by 69
Self-citationUtility-based association rule mining: A marketing solution for cross-selling
Lee, D., Park, S.-H., & Moon, S. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.11.021 · Cited by 66
Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining
Lin, J. C., Wu, T., Fournier‐Viger, P., Lin, G., Zhan, J. Z., & Vozn̆ák, M. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2016.07.003 · Cited by 66
Self-citationOnline mining of temporal maximal utility itemsets from data streams
Shie, B.-E., Tseng, V. S. M., & Yu, P. S. (2010) · ACM Symposium on Applied Computing · doi:10.1145/1774088.1774436 · Cited by 65
Self-citationUnsupervised Rare Pattern Mining: A Survey
Koh, Y. S., & Ravana, S. D. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2898359 · Cited by 63
EFFICIENTLY MINING HIGH AVERAGE-UTILITY ITEMSETS WITH AN IMPROVED UPPER-BOUND STRATEGY
Lan, G.-C., Hong, T., & Tseng, V. S. M. (2012) · International Journal of Information Technology & Decision Making · doi:10.1142/s0219622012500307 · Cited by 61
Self-citationRyang, H., & Yun, U. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-016-0989-x · Cited by 60
mHUIMiner: A Fast High Utility Itemset Mining Algorithm for Sparse Datasets
Peng, A. Y., Koh, Y. S., & Riddle, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-57529-2_16 · Cited by 60
Shie, B.-E., Hsiao, H.-F., & Tseng, V. S. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-012-0483-z · Cited by 56
Self-citationIncremental association rule mining: a survey
Nath, B., Bhattacharyya, D. K., & Ghosh, A. K. (2013) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1086 · Cited by 56
A framework for mining interesting high utility patterns with a strong frequency affinity
Ahmed, C. F., Tanbeer, S. K., Jeong, B.-S., & Choi, H. (2011) · Information Sciences · doi:10.1016/j.ins.2011.05.012 · Cited by 55
Approximate Parallel High Utility Itemset Mining
Chen, Y., & An, A. (2016) · Big Data Research · doi:10.1016/j.bdr.2016.07.001 · Cited by 54
Fast algorithms for mining high-utility itemsets with various discount strategies
Lin, J. C., Gan, W., Fournier‐Viger, P., Hong, T., & Tseng, V. S. M. (2016) · Advanced Engineering Informatics · doi:10.1016/j.aei.2016.02.003 · Cited by 51
Self-citationRWFIM: Recent weighted-frequent itemsets mining
Lin, J. C., Gan, W., Fournier‐Viger, P., & Hong, T. (2015) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.06.009 · Cited by 45
Self-citationFast algorithm for high utility pattern mining with the sum of item quantities
Ryang, H., Yun, U., & Ryu, K. H. (2016) · Intelligent Data Analysis · doi:10.3233/ida-160811 · Cited by 42
A GA-Based Approach to Hide Sensitive High Utility Itemsets
Lin, J. C., Hong, T., Wong, J.-W., Lan, G.-C., & Lin, W.-Y. (2014) · The Scientific World JOURNAL · doi:10.1155/2014/804629 · Cited by 38
Self-citationLiu, Y., Cheng, C.-P., & Tseng, V. S. M. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-230 · Cited by 37
Self-citationDiscovering utility-based episode rules in complex event sequences
Lin, Y.-F. F., Wu, C., Huang, C., & Tseng, V. S. M. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.02.022 · Cited by 31
Self-citationA high utility itemset mining algorithm based on subsume index
Song, W. G., Zhang, Z., & Li, J. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-015-0900-1 · Cited by 27
Efficient hiding of confidential high-utility itemsets with minimal side effects
Lin, J. C., Hong, T., Fournier‐Viger, P., Liu, Q., Wong, J.-W., & Zhan, J. Z. (2017) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/0952813x.2017.1328462 · Cited by 24
Self-citationA novel methodology for stock investment using high utility episode mining and genetic algorithm
Lin, Y.-F. F., Huang, C., & Tseng, V. S. M. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.05.032 · Cited by 20
Self-citation
Cited by
Metaverse in Education: Vision, Opportunities, and Challenges
Lin, H., Wan, S., Gan, W., Chen, J., & Chao, H.-C. (2022) · 2022 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata55660.2022.10021004 · Cited by 305
Self-citationReliable customer analysis using federated learning and exploring deep-attention edge intelligence
Ahmed, U., Srivastava, G., & Lin, J. C.-W. (2022) · Future Generation Computer Systems · doi:10.1016/j.future.2021.08.028 · Cited by 52
Self-citationData Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Koukaras, P., & Tjortjis, C. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc9100258 · Cited by 3
Shu, L., Jiang, Z., Fei, Y., Luo, Y., Ouyang, D., Zhang, Y., Li, J., & Zhang, H. (2026) · Environmental Research · doi:10.1016/j.envres.2026.124645
Metadata
- Authors
- Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2021-04-01
- Volume
- 33
- Issue
- 4
- Pages
- 1306-1327
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2804685987
- Cited by
- 257
- References
- 93
- FWCI
- 38.11
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.