MUSK: Uniform sampling of k maximal patterns

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 646-657

  Al Hasan, Mohammad ^a   Zaki, Mohammed ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACH; FREQUENT PATTERN MINING; FREQUENT PATTERNS; ITEMSET; MARKOV CHAIN MONTE CARLO ALGORITHMS; MAXIMAL FREQUENT PATTERN; PARTIAL ORDER; PATTERN SET; RANDOM WALK; STATIONARY DISTRIBUTION; TRANSITION PROBABILITY MATRIX; TWO STEP METHOD; UNIFORM SAMPLING;

DATA MINING; GRAPH THEORY; MARKOV PROCESSES; MUSKEG;

SAMPLING;

EID: 72749121831     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. F. Afrati, G. Gionis, and H. Mannila. Approximating a collection of frequent sets. In KDD Proceedings. ACM, August 2004.
2. T. Calders, C. Rigotti, and J.-F. Boulicaut. A Survey on Condensed Representation for Frequent Sets. Lecture Notes in Computer Science, 3848:64-80, February 2006.
3. V. Chaoji, M. Hasan, S. Salem, J. Besson, and M. Zaki. ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns. Statistical Analysis and Data Mining, 1(2):67-84, June 2008.
4. V. Chaoji, M. Hasan, S. Salem, and M. Zaki. An Integrated, Generic Approach to Pattern Mining: Data Mining Template Library. Data Mining and Knowledge Discovery Journal, 17(3):457-495, 2008.
5. R. K. Chung. Spectral Graph Theory. Americal Mathematical Society, 1997.
6. K. Gouda and M. Zaki. GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Mining and Knowledge Discovery, 11:1-20, 2005.
7. J. Huan, W. Wang, J. Prins, and J. Yang. SPIN: Mining Maximal Frequent Subgraphs from Graph Databases. In KDD Proceedings. ACM, 2004.
8. A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321-354, 2003.
9. M. Kuramochi and G. Karypis. An Efficient Algorithm for Discovering Frequent Subgraphs. IEEE Trans. on Knowledge and Data Engineering, 16(9): 1038-1051, 2004.
10. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In KDD Proceedings. ACM, 2004.
12. R. Y. Rubinstein and D. K. Kroese. Simulation and the Monte Carlo Method, 2nd Ed. John Wiley & Sons, 2008.
13. A. Sinclair. Algorithms for Random Generation and Counting. BirkHauser, 1992.
14. J. R. Ullmann. An Algorithm for Subgraph Isomorphism. Journal of ACM, 23(1):31-42, 1976.
15. C. Wang and S. Parthasarathy. Summarizing Itemset Patterns Using Probabilistic Models. In KDD Proceedings. ACM, August 2006.
16. D. Xin, H. Cheng, X. Yan, and J. Han. Extracting Redundancy-Aware Top-k Patterns. In KDD Proceedings. ACM, August 2006.
17. D. Xin, J. Han, X. Yan, and H. Cheng. Mining Compressed Frequent-Pattern Sets. In VLDB Proceedings. ACM, August 2005.
18. X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing Itemset Patterns: A Profile-Based Approach. In KDD Proceedings. ACM, August 2005.
19. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining Significant Graph Patterns by Leap Search. In SIGMOD Proceedings. ACM, 2008.
20. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In ICDM Proceedings. IEEE, 2002.
21. X. Yan and J. Han. CloseGraph: Mining Closed Frequent Graph Patterns. In KDD Proceedings. ACM, 2003.
22. G. Yang. The Complexity of Mining Maximal Frequent Itemsets and Maximal Frequent Patterns. In KDD Proceedings. ACM, 2004.