default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 696 matches
- 2024
- Muhammad Sadeequllah, Azhar Rauf, Saif Ur Rehman, Noha Alnazzawi:
Probabilistic Support Prediction: Fast Frequent Itemset Mining in Dense Data. IEEE Access 12: 39330-39350 (2024) - Gautam Srivastava, Jerry Chun-Wei Lin, Guo Lin:
Secure itemset hiding in smart city sensor data. Clust. Comput. 27(2): 1361-1374 (2024) - Pushp Sra, Satish Chand:
A Reinduction-Based Approach for Efficient High Utility Itemset Mining from Incremental Datasets. Data Sci. Eng. 9(1): 73-87 (2024) - Xiaolong Wan, Xixian Han:
Efficient Top-k Frequent Itemset Mining on Massive Data. Data Sci. Eng. 9(2): 177-203 (2024) - N. T. Tung, Trinh D. D. Nguyen, Loan T. T. Nguyen, Bay Vo:
An efficient method for mining High-Utility itemsets from unstable negative profit databases. Expert Syst. Appl. 237(Part C): 121489 (2024) - Mathe John Kenny Kumar, Dipti Rana:
HARUIM: high average recent utility itemset mining. Int. J. Data Min. Model. Manag. 16(1): 66-100 (2024) - B. Sivaiah, R. Rajeswara Rao:
A node sets based fast and scalable frequent itemset algorithm for mining big data using map reduce paradigm. Int. J. Data Min. Model. Manag. 16(3): 326-343 (2024) - Antonio Manuel Trasierras, José María Luna, Philippe Fournier-Viger, Sebastián Ventura:
Data heterogeneity's impact on the performance of frequent itemset mining algorithms. Inf. Sci. 678: 120981 (2024) - Meng Han, Shujuan Liu, Zhihui Gao, Dongliang Mu, Ang Li:
Mining Top-K constrained cross-level high-utility itemsets over data streams. Knowl. Inf. Syst. 66(5): 2885-2924 (2024) - Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, Quang-Thinh Bui, Loan T. T. Nguyen, Unil Yun, Bay Vo:
An efficient strategy for mining high-efficiency itemsets in quantitative databases. Knowl. Based Syst. 299: 112035 (2024) - Kuldeep Singh, Bhaskar Biswas:
Mining Top-k High On-shelf Utility Itemsets Using Novel Threshold Raising Strategies. ACM Trans. Knowl. Discov. Data 18(5): 131:1-131:23 (2024) - Wei Fang, Haipeng Jiang, Hengyang Lu, Jun Sun, Xiaojun Wu, Jerry Chun-Wei Lin:
GPU-Based Efficient Parallel Heuristic Algorithm for High-Utility Itemset Mining in Large Transaction Datasets. IEEE Trans. Knowl. Data Eng. 36(2): 652-667 (2024) - Jingxuan He, Xixian Han, Xiaolong Wan, Jinbao Wang:
Efficient Skyline Frequent-Utility Itemset Mining Algorithm on Massive Data. IEEE Trans. Knowl. Data Eng. 36(7): 3009-3023 (2024) - Wei Fang, Haipeng Jiang, Hengyang Lu, Jun Sun, Xiaojun Wu, Jerry Chun-Wei Lin:
GPU-Based Efficient Parallel Heuristic Algorithm for High-Utility Itemset Mining in Large Transaction Datasets (Extended Abstract). ICDE 2024: 5733-5734 - Wei Tong, Haoyu Chen, Jiacheng Niu, Sheng Zhong:
Data Poisoning Attacks to Locally Differentially Private Frequent Itemset Mining Protocols. CoRR abs/2406.19466 (2024) - 2023
- Hong N. Dao, Penugonda Ravikumar, Palla Likhitha, Rage Uday Kiran, Yutaka Watanobe, Incheon Paik:
Finding Stable Periodic-Frequent Itemsets in Big Columnar Databases. IEEE Access 11: 12504-12524 (2023) - Rage Uday Kiran, Pamalla Veena, Penugonda Ravikumar, Bathala Venus Vikranth Raj, Minh-Son Dao, Koji Zettsu, Sai Chithra Bommisetti:
HDSHUI-miner: a novel algorithm for discovering spatial high-utility itemsets in high-dimensional spatiotemporal databases. Appl. Intell. 53(8): 8536-8561 (2023) - Rajiv Kumar, Kuldeep Singh:
High utility itemsets mining from transactional databases: a survey. Appl. Intell. 53(22): 27655-27703 (2023) - Majid Moghtadai, Farsad Zamani Boroujeni, Mohammadreza Soltanaghaei:
A framework for proposing a liquid stock portfolio using frequent itemset mining from time-series data. Appl. Intell. 53(21): 25640-25661 (2023) - Amel Hidouri, Saïd Jabbour, Badran Raddaoui, Boutheina Ben Yaghlane:
Corrigendum to "Mining Closed High Utility Itemsets based on Propositional Satisfiability" [Data Knowl. Eng. 136C (2021) 101927]. Data Knowl. Eng. 146: 102200 (2023) - Eduardus Hardika Sandy Atmaja, Kavita V. Sonawane:
Distributed computing and shared memory-based utility list buffer miner with parallel frameworks for high utility itemset mining. Int. J. Bus. Intell. Data Min. 23(2): 125-149 (2023) - Abdullah Bokir, V. B. Narasimha:
Variable item value-based high utility itemset recommendation using statistical approach. Int. J. Bus. Intell. Data Min. 23(2): 101-124 (2023) - Makhlouf Ledmi, Mohammed El Habib Souidi, Michael Hahsler, Abdeldjalil Ledmi, Chafia Kara-Mohamed:
Mining association rules for classification using frequent generator itemsets in arules package. Int. J. Data Min. Model. Manag. 15(2): 203-221 (2023) - Moumita Ghosh, Anirban Roy, Pritam Sil, Kartick Chandra Mondal:
Frequent itemset mining using FP-tree: a CLA-based approach and its extended application in biodiversity data. Innov. Syst. Softw. Eng. 19(3): 283-301 (2023) - Jun Lu, Wenhe Xu, Kailong Zhou, Zhicong Guo:
Frequent Itemset Mining Algorithm Based on Linear Table. J. Database Manag. 34(1): 1-21 (2023) - C. Saravanabhavan, S. Kirubakaran, R. Premkumar, V. Jemmy Joyce:
Fuzzy based optimized itemset mining in high dimensional transactional database using adaptable FCM. J. Intell. Fuzzy Syst. 44(4): 6957-6971 (2023) - Meng Han, Haodong Cheng, Ni Zhang, Xiaojuan Li, Le Wang:
An efficient algorithm for mining closed high utility itemsets over data streams with one dataset scan. Knowl. Inf. Syst. 65(1): 207-240 (2023) - Muhang Li, Meng Han, Zhiqiang Chen, Hongxin Wu, Xilong Zhang:
FCHM-stream: fast closed high utility itemsets mining over data streams. Knowl. Inf. Syst. 65(6): 2509-2539 (2023) - Trinh D. D. Nguyen, N. T. Tung, Thiet Pham, Loan T. T. Nguyen:
Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowl. Based Syst. 276: 110733 (2023) - P. P. Jashma Suresh, U. Dinesh Acharya, N. V. Subba Reddy:
Mining frequent Itemsets from transaction databases using hybrid switching framework. Multim. Tools Appl. 82(18): 27571-27591 (2023)
skipping 666 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-21 02:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint