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

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 95-104

  Bhuiyan, Mansurul ^a   Mukhopadhyay, Snehasis ^a   Hasan, Mohammad Al ^a  

^a Purdue University School of Science   (United States)

Author keywords

interactive pattern mining; MCMC sampling

Indexed keywords

DATA SETS; MARKOV CHAIN MONTE CARLO; MCMC SAMPLING; PATTERN MINING; REAL LIFE DATASETS; REAL-LIFE APPLICATIONS; SAMPLING-BASED; USER SESSIONS;

KNOWLEDGE MANAGEMENT;

COMMERCE;

EID: 84871074224     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396777     Document Type: Conference Paper

References (31)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. of VLDB, pages 487-499, 1994.
2. I. Benjamini, G. Kozma, and W. N. The mixing time of the giant component of a random graph. 2006.
3. T. D. Bie. Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery.
4. M. Boley and H. Grosskreutz. Approximating the number of frequent sets in dense data. Knowledge and Information Systems, 21:65-89, 2009.
5. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Exante: Anticipated data reduction in constrained pattern mining. In Proc. of the 4th PKDD, pages 59-70, 2003.
6. S. Bringmann, A. Zimmermann, L. Raedt, and S. Nijssen. Don't be afraid of simpler pattern. In PKDD, pages 55-66, 2004.
7. C. Bucila, J. Gehrke, and D. K. andW. White. Dualminer: A dual-pruning algorithm for itemsets withconstraints. Data Mining and Knowledge Discovery, 2003.
8. T. K. Chia, K. C. Sim, H. Li, and H. T. Ng. A lattice-based approach to query-by-example spoken document retrieval. In Proc. of the 31st ACM SIGIR conference on Research and development in information retrieval, pages 363-370, 2008.
9. R. K. Chung. Spectral Graph Theory. Americal Mathematical Society, 1997.
10. A. Dasgupta, X. Jin, B. Jewell, N. Zhang, and G. Das. Unbiased estimation of size and other aggregates over hidden web databases. In Proceedings of the 2010 international conference on Management of data, pages 855-866, 2010.
11. A. Dasgupta, N. Zhang, and G. Das. Leveraging count information in sampling hidden databases. In ICDE '09, pages 329-340, 2009.
12. A. Dasgupta, N. Zhang, and G. Das. Turbo-charging hidden database samplers with overflowing queries and skew reduction. In Proceedings of the 13th International Conference on Extending Database Technology, pages 51-62, 2010.
13. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 202-210, 2003.
14. B. Goethals, S. Moens, and J. Vreeken. Mime: A framework for interactive visual pattern mining. In ECML, pages 757-760, 2011.
15. O. Goldreich. Foundations of Cryptography Volume II Basic Applications. Cambridge University Press, 2004.
16. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8, Jan. 2004.
17. M. Hasan and M. Zaki. Uniform sampling of k maximal patterns. In SIAM Data Mining, 2009.
18. M. A. Hasan, N. Parikh, G. Singh, and N. Sundaresan. Query suggestion for e-commerce sites. In Proc. of the fourth ACM international conference on Web search and data mining, WSDM '11, pages 765-774, 2011.
19. M. A. Hasan and M. J. Zaki. Output space sampling for graph patterns. In Proc. International Conference on Very Large Data Bases (VLDB), pages 730-741, 2009.
20. S. Jagabathula, N. Mishra, and S. Gollapudi. Shopping for products you don't know you need. In Proc. of the fourth ACM international conference on Web search and data mining, pages 705-714, 2011.
21. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In In Proc. of ICDM'01.
22. M. Mampaey, N. Tatti, and J. Vreeken. Tell me what i need to know: succinctly summarizing data with itemsets. In Proc. of the 17th ACM SIGKDD.
23. A. Marian, N. Bruno, and L. Gravano. Evaluating top-k queries over web-accessible databases. ACM Trans. Database Syst., 29, 2004.
24. N. Mishra, R. Saha Roy, N. Ganguly, S. Laxman, and M. Choudhury. Unsupervised query segmentation using only query logs. In Proc. of the 20th international conference companion on WWW'11, pages 91-92.
25. S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In Proc. of the 27th VLDB, pages 129-138, 2001.
26. P. N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proc.of SIGKDD, pages 32-41, 2002.
27. Y. Wang and X. Wu. Approximate inverse frequent itemset mining: Privacy, complexity, and approximation. In Proc. of the 5th ICDM, 2005.
28. D. Xin, X. Shen, Q. Mei, and J. Han. Discovering interesting patterns through user's interactive feedback. In Proc. of the 12th ACM SIGKDD, 2006.
29. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In In proc. of ICDM, 2002.
30. M. Zaki. Spade: An efficient algorithm for mining frequent sequences. Machine Learning, 42, 2001.
31. M. J. Zaki. Efficiently mining frequent trees in a forest: Algorithms and applications. In IEEE Tans. on knowledge and data engineering, 17:8, 2005.