Interactive pattern mining on hidden data: A sampling-based solution

Mansurul Bhuiyan, Snehasis Mukhopadhyay, Mohammad Al Hasan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

Mining frequent patterns from a hidden dataset is an important task with 43 various real-life applications. In this research, we propose a solution to this problem that is based on Markov Chain Monte Carlo (MCMC) sampling of frequent patterns. Instead of returning all the frequent patterns, the proposed paradigm returns a small set of randomly selected patterns so that the clandestinity of the dataset can be maintained. Our solution also allows interactive sampling, so that the sampled patterns can fulfill the user's requirement effectively. We show experimental results from several real life datasets to validate the capability and usefulness of our solution; in particular, we show examples that by using our proposed solution, an eCommerce marketplace can allow pattern mining on user session data without disclosing the data to the public; such a mining paradigm helps the sellers of the marketplace, which eventually boost the marketplace's own revenue.

Original languageEnglish
Title of host publicationACM International Conference Proceeding Series
Pages95-104
Number of pages10
DOIs
Publication statusPublished - 19 Dec 2012
Event21st ACM International Conference on Information and Knowledge Management, CIKM 2012 - Maui, HI, United States
Duration: 29 Oct 20122 Nov 2012

Other

Other21st ACM International Conference on Information and Knowledge Management, CIKM 2012
CountryUnited States
CityMaui, HI
Period29/10/122/11/12

Fingerprint

Sampling
Markov processes

Keywords

  • interactive pattern mining
  • MCMC sampling

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Bhuiyan, M., Mukhopadhyay, S., & Hasan, M. A. (2012). Interactive pattern mining on hidden data: A sampling-based solution. In ACM International Conference Proceeding Series (pp. 95-104) https://doi.org/10.1145/2396761.2396777

Interactive pattern mining on hidden data : A sampling-based solution. / Bhuiyan, Mansurul; Mukhopadhyay, Snehasis; Hasan, Mohammad Al.

ACM International Conference Proceeding Series. 2012. p. 95-104.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bhuiyan, M, Mukhopadhyay, S & Hasan, MA 2012, Interactive pattern mining on hidden data: A sampling-based solution. in ACM International Conference Proceeding Series. pp. 95-104, 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, Maui, HI, United States, 29/10/12. https://doi.org/10.1145/2396761.2396777
Bhuiyan M, Mukhopadhyay S, Hasan MA. Interactive pattern mining on hidden data: A sampling-based solution. In ACM International Conference Proceeding Series. 2012. p. 95-104 https://doi.org/10.1145/2396761.2396777
Bhuiyan, Mansurul ; Mukhopadhyay, Snehasis ; Hasan, Mohammad Al. / Interactive pattern mining on hidden data : A sampling-based solution. ACM International Conference Proceeding Series. 2012. pp. 95-104
@inproceedings{502563987cae4751baa807bbd6818136,
title = "Interactive pattern mining on hidden data: A sampling-based solution",
abstract = "Mining frequent patterns from a hidden dataset is an important task with 43 various real-life applications. In this research, we propose a solution to this problem that is based on Markov Chain Monte Carlo (MCMC) sampling of frequent patterns. Instead of returning all the frequent patterns, the proposed paradigm returns a small set of randomly selected patterns so that the clandestinity of the dataset can be maintained. Our solution also allows interactive sampling, so that the sampled patterns can fulfill the user's requirement effectively. We show experimental results from several real life datasets to validate the capability and usefulness of our solution; in particular, we show examples that by using our proposed solution, an eCommerce marketplace can allow pattern mining on user session data without disclosing the data to the public; such a mining paradigm helps the sellers of the marketplace, which eventually boost the marketplace's own revenue.",
keywords = "interactive pattern mining, MCMC sampling",
author = "Mansurul Bhuiyan and Snehasis Mukhopadhyay and Hasan, {Mohammad Al}",
year = "2012",
month = "12",
day = "19",
doi = "10.1145/2396761.2396777",
language = "English",
isbn = "9781450311564",
pages = "95--104",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Interactive pattern mining on hidden data

T2 - A sampling-based solution

AU - Bhuiyan, Mansurul

AU - Mukhopadhyay, Snehasis

AU - Hasan, Mohammad Al

PY - 2012/12/19

Y1 - 2012/12/19

N2 - Mining frequent patterns from a hidden dataset is an important task with 43 various real-life applications. In this research, we propose a solution to this problem that is based on Markov Chain Monte Carlo (MCMC) sampling of frequent patterns. Instead of returning all the frequent patterns, the proposed paradigm returns a small set of randomly selected patterns so that the clandestinity of the dataset can be maintained. Our solution also allows interactive sampling, so that the sampled patterns can fulfill the user's requirement effectively. We show experimental results from several real life datasets to validate the capability and usefulness of our solution; in particular, we show examples that by using our proposed solution, an eCommerce marketplace can allow pattern mining on user session data without disclosing the data to the public; such a mining paradigm helps the sellers of the marketplace, which eventually boost the marketplace's own revenue.

AB - Mining frequent patterns from a hidden dataset is an important task with 43 various real-life applications. In this research, we propose a solution to this problem that is based on Markov Chain Monte Carlo (MCMC) sampling of frequent patterns. Instead of returning all the frequent patterns, the proposed paradigm returns a small set of randomly selected patterns so that the clandestinity of the dataset can be maintained. Our solution also allows interactive sampling, so that the sampled patterns can fulfill the user's requirement effectively. We show experimental results from several real life datasets to validate the capability and usefulness of our solution; in particular, we show examples that by using our proposed solution, an eCommerce marketplace can allow pattern mining on user session data without disclosing the data to the public; such a mining paradigm helps the sellers of the marketplace, which eventually boost the marketplace's own revenue.

KW - interactive pattern mining

KW - MCMC sampling

UR - http://www.scopus.com/inward/record.url?scp=84871074224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871074224&partnerID=8YFLogxK

U2 - 10.1145/2396761.2396777

DO - 10.1145/2396761.2396777

M3 - Conference contribution

AN - SCOPUS:84871074224

SN - 9781450311564

SP - 95

EP - 104

BT - ACM International Conference Proceeding Series

ER -