NDLI: Knowledge discovery of customer purchasing intentions by plausible-frequent itemsets from uncertain data

Content Provider	Springer Nature Link
Author	Weng, Cheng Hsiung Huang, Tony Cheng Kui
Copyright Year	2015
Abstract	Many previous studies have focused on the extraction of association rules from transaction data. Unfortunately, customer purchasing intentions tend to be uncertain during the decision making process. That is, they cannot be obtained from business transaction data. Therefore, the research problem is how to discover frequent itemsets from uncertain data. This study first proposes a new model to represent consumer uncertainty during the decision making process. This representation scheme is based on possibility distributions. The possibility theory provides an excellent framework for handling uncertain data. In addition, an algorithm is developed to mine plausible-frequent itemsets from uncertain data, which are represented by possibility distributions, and then discover plausible association rules based on these plausible-frequent itemsets. Experimental results show that the proposed model can discover interesting plausible-frequent patterns from survey data which represent customer purchasing decisions.
Starting Page	598
Ending Page	613
Page Count	16
File Format	PDF
ISSN	0924669X
Journal	Applied Intelligence
Volume Number	43
Issue Number	3
e-ISSN	15737497
Language	English
Publisher	Springer US
Publisher Date	2015-05-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Data mining Association rule Plausible-frequent itemsets Possibility distributions Uncertain data Artificial Intelligence (incl. Robotics) Mechanical Engineering Manufacturing, Machines, Tools
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence

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

Weighted frequent itemset mining over uncertain databases

An efficient algorithm for incrementally mining frequent closed itemsets

Updating generalized association rules with evolving taxonomies

Stream mining on univariate uncertain data

Associating absent frequent itemsets with infrequent items to identify abnormal transactions

An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining

Hiding collaborative recommendation association rules

HUC-Prune: an efficient candidate pruning technique to mine high utility patterns

Mining Fuzzy Multiple-Level Association Rules from Quantitative Data

Knowledge discovery of customer purchasing intentions by plausible-frequent itemsets from uncertain data

Similar Documents

Weighted frequent itemset mining over uncertain databases

An efficient algorithm for incrementally mining frequent closed itemsets

Updating generalized association rules with evolving taxonomies

Stream mining on univariate uncertain data

Associating absent frequent itemsets with infrequent items to identify abnormal transactions

An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining

Hiding collaborative recommendation association rules

HUC-Prune: an efficient candidate pruning technique to mine high utility patterns

Mining Fuzzy Multiple-Level Association Rules from Quantitative Data

Knowledge discovery of customer purchasing intentions by plausible-frequent itemsets from uncertain data