NDLI: A fast high utility itemsets mining algorithm

Please wait, while we are loading the content...

Toward economic machine learning and utility-based data mining

Economical active feature-value acquisition through Expected Utility estimation

Machine learning paradigms for utility-based data mining

Reinforcement learning for active model selection

Cost-sensitive classifier evaluation

Wrapper-based computation and evaluation of sampling methods for imbalanced datasets

Noisy information value in utility-based decision making

Learning policies for sequential time and cost sensitive classification

Improving classifier utility by altering the misclassification cost ratio

One-Benefit learning: cost-sensitive learning with restricted cost information

Utility based data mining for time series analysis: cost-sensitive learning for neural network predictors

Does cost-sensitive learning beat sampling for classifying rare classes?

Interruptible anytime algorithms for iterative improvement of decision trees

Contextual recommender problems [extended abstract]

A fast high utility itemsets mining algorithm

A fast high utility itemsets mining algorithm

Content Provider	ACM Digital Library
Author	Choudhary, Alok Liao, Wei-keng Liu, Ying
Abstract	Association rule mining (ARM) identifies frequent itemsets from databases and generates association rules by considering each item in equal value. However, items are actually different in many aspects in a number of real applications, such as retail marketing, network log, etc. The difference between items makes a strong impact on the decision making in these applications. Therefore, traditional ARM cannot meet the demands arising from these applications. By considering the different values of individual items as utilities, utility mining focuses on identifying the itemsets with high utilities. As "downward closure property" doesn't apply to utility mining, the generation of candidate itemsets is the most costly in terms of time and memory space. In this paper, we present a Two-Phase algorithm to efficiently prune down the number of candidates and can precisely obtain the complete set of high utility itemsets. In the first phase, we propose a model that applies the "transaction-weighted downward closure property" on the search space to expedite the identification of candidates. In the second phase, one extra database scan is performed to identify the high utility itemsets. We also parallelize our algorithm on shared memory multi-process architecture using Common Count Partitioned Database (CCPD) strategy. We verify our algorithm by applying it to both synthetic and real databases. It performs very efficiently in terms of speed and memory cost, and shows good scalability on multiple processors, even on large databases that are difficult for existing algorithms to handle.
Starting Page	90
Ending Page	99
Page Count	10
File Format	PDF
ISBN	1595932089
DOI	10.1145/1089827.1089839
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-08-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Utility mining Downward closure property Transaction-weighted utilization Association rules mining
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in