-
1
-
-
0001882616
-
Fast algorithms for mining association rules in large databases
-
San Francisco, CA, USA. Morgan Kaufmann Publishers Inc
-
Agrawal, R. and Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In VLDB '94: Proceedings of the 1994 International Conference on Very Large Data Bases, pages 487-499, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
-
(1994)
VLDB '94: Proceedings of the 1994 International Conference on Very Large Data Bases
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
-
2
-
-
63049112029
-
Latent dirichlet allocation in web spam filtering
-
New York, NY, USA. ACM
-
Bíró, I., Szabó, J., and Benczúr, A. A. (2008). Latent dirichlet allocation in web spam filtering. In AIRWeb '08: Proceedings of the 4th international workshop on Adversarial information retrieval on the web, pages 29-32, New York, NY, USA. ACM.
-
(2008)
AIRWeb '08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web
, pp. 29-32
-
-
Bíró, I.1
Szabó, J.2
Benczúr, A.A.3
-
4
-
-
8644225400
-
Hierarchical topic models and the nested Chinese restaurant process
-
Blei, D. M., Griffiths, T. L., Jordan, M. I., and Tenenbaum, J. B. (2004). Hierarchical topic models and the nested chinese restaurant process. In NIPS '04: Advances in Neural Information Processing Systems.
-
(2004)
NIPS '04: Advances in Neural Information Processing Systems
-
-
Blei, D.M.1
Griffiths, T.L.2
Jordan, M.I.3
Tenenbaum, J.B.4
-
6
-
-
0141607824
-
Latent Dirichlet allocation
-
Blei, D. M., Ng, A. Y., and Jordan, M. I. (2003). Latent dirichlet allocation. Journal of Machine Learning Research, 3:993-1022.
-
(2003)
Journal of Machine Learning Research
, vol.3
, pp. 993-1022
-
-
Blei, D.M.1
Ng, A.Y.2
Jordan, M.I.3
-
8
-
-
0031162961
-
Dynamic itemset counting and implication rules for market basket data
-
New York, NY, USA. ACM
-
Brin, S., Motwani, R., Ullman, J. D., and Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. In SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 255-264, New York, NY, USA. ACM.
-
(1997)
SIGMOD '97: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data
, pp. 255-264
-
-
Brin, S.1
Motwani, R.2
Ullman, J.D.3
Tsur, S.4
-
9
-
-
34548741255
-
Discriminative frequent pattern analysis for effective classification
-
Cheng, H., Yan, X., Han, J., and wei Hsu, C. (2007). Discriminative frequent pattern analysis for effective classification. In In ICDE, pages 716-725.
-
(2007)
ICDE
, pp. 716-725
-
-
Cheng, H.1
Yan, X.2
Han, J.3
Wei Hsu, C.4
-
10
-
-
0002629270
-
Maximum likelihood from incomplete data via the em algorithm
-
Dempster, A. P., Laird, N. M., and Rubin., D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of Royal Statist. Soc. B, 39:1-38.
-
(1977)
Journal of Royal Statist. Soc. B
, vol.39
, pp. 1-38
-
-
Dempster, A.P.1
Laird, N.M.2
Rubin, D.B.3
-
11
-
-
67649646374
-
Efficient mining of closed repetitive gapped subsequences from a sequence database
-
Washington, DC, USA. IEEE Computer Society
-
Ding, B., Lo, D., Han, J., and Khoo, S.-C. (2009). Efficient mining of closed repetitive gapped subsequences from a sequence database. In Proceedings of the 2009 IEEE International Conference on Data Engineering, ICDE '09, pages 1024-1035, Washington, DC, USA. IEEE Computer Society.
-
(2009)
Proceedings of the 2009 IEEE International Conference on Data Engineering, ICDE '09
, pp. 1024-1035
-
-
Ding, B.1
Lo, D.2
Han, J.3
Khoo, S.-C.4
-
12
-
-
0021518209
-
Stochastic relaxation, gibbs distributions and the bayesian restoration of images
-
Geman, S. and Geman, D. (1984). Stochastic relaxation, gibbs distributions and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):721-741.
-
(1984)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.6
, Issue.6
, pp. 721-741
-
-
Geman, S.1
Geman, D.2
-
14
-
-
0039253846
-
Mining frequent patterns without candidate generation
-
New York, NY, USA. ACM
-
Han, J., Pei, J., and Yin, Y. (2000). Mining frequent patterns without candidate generation. In SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 1-12, New York, NY, USA. ACM.
-
(2000)
SIGMOD '00: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data
, pp. 1-12
-
-
Han, J.1
Pei, J.2
Yin, Y.3
-
16
-
-
36849095498
-
Image retrieval on large-scale image databases
-
New York, NY, USA. ACM
-
Hörster, E., Lienhart, R., and Slaney, M. (2007). Image retrieval on large-scale image databases. In CIVR '07: Proceedings of the 2007 ACM international conference on Image and video retrieval, pages 17-24, New York, NY, USA. ACM.
-
(2007)
CIVR '07: Proceedings of the 2007 ACM International Conference on Image and Video Retrieval
, pp. 17-24
-
-
Hörster, E.1
Lienhart, R.2
Slaney, M.3
-
17
-
-
74849120851
-
Joint sentiment/topic model for sentiment analysis
-
New York, NY, USA. ACM
-
Lin, C. and He, Y. (2009). Joint sentiment/topic model for sentiment analysis. In CIKM '09: Proceedings of the 2009 ACM international Conference on Information and Knowledge Management, pages 375-384, New York, NY, USA. ACM.
-
(2009)
CIKM '09: Proceedings of the 2009 ACM International Conference on Information and Knowledge Management
, pp. 375-384
-
-
Lin, C.1
He, Y.2
-
18
-
-
71149111201
-
Topic-link lda: Joint models of topic and author community
-
New York, NY, USA. ACM
-
Liu, Y., Niculescu-Mizil, A., and Gryc, W. (2009). Topic-link lda: joint models of topic and author community. In ICML '09: Proceedings of the 2009 annual International Conference on Machine Learning, pages 665-672, New York, NY, USA. ACM.
-
(2009)
ICML '09: Proceedings of the 2009 Annual International Conference on Machine Learning
, pp. 665-672
-
-
Liu, Y.1
Niculescu-Mizil, A.2
Gryc, W.3
-
19
-
-
35348882767
-
Topic sentiment mixture: Modeling facets and opinions in weblogs
-
New York, NY, USA. ACM
-
Mei, Q., Ling, X., Wondra, M., Su, H., and Zhai, C. (2007). Topic sentiment mixture: modeling facets and opinions in weblogs. In WWW '07: Proceedings of the 2007 international conference on World Wide Web, pages 171-180, New York, NY, USA. ACM.
-
(2007)
WWW '07: Proceedings of the 2007 International Conference on World Wide Web
, pp. 171-180
-
-
Mei, Q.1
Ling, X.2
Wondra, M.3
Su, H.4
Zhai, C.5
-
20
-
-
73649116099
-
Polylingual topic models
-
Mimno, D., Wallach, H. M., Naradowsky, J., Smith, D. A., and Mccallum, A. (2009). Polylingual topic models. In EMNLP '09: Proceedings of the 2009 conference on Empirical Methods in Natural Language Processing.
-
(2009)
EMNLP '09: Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing
-
-
Mimno, D.1
Wallach, H.M.2
Naradowsky, J.3
Smith, D.A.4
McCallum, A.5
-
21
-
-
1842751687
-
Expectation-propogation for the generative aspect model
-
Minka, T. P. and Lafferty, J. D. (2002). Expectation-propogation for the generative aspect model. In UAI, pages 352-359.
-
(2002)
UAI
, pp. 352-359
-
-
Minka, T.P.1
Lafferty, J.D.2
-
22
-
-
84976830511
-
An effective hash-based algorithm for mining association rules
-
New York, NY, USA. ACM
-
Park, J. S., Chen, M.-S., and Yu, P. S. (1995). An effective hash-based algorithm for mining association rules. In SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data, pages 175-186, New York, NY, USA. ACM.
-
(1995)
SIGMOD '95: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data
, pp. 175-186
-
-
Park, J.S.1
Chen, M.-S.2
Yu, P.S.3
-
23
-
-
84911977993
-
Discovering frequent closed itemsets for association rules
-
London, UK. Springer-Verlag
-
Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In ICDT '99: Proceedings of the 7th International Conference on Database Theory, pages 398-416, London, UK. Springer-Verlag.
-
(1999)
ICDT '99: Proceedings of the 7th International Conference on Database Theory
, pp. 398-416
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
24
-
-
0002625450
-
Closet: An efficient algorithm for mining frequent closed itemsets
-
New York, NY, USA. ACM
-
Pei, J., Han, J., and Mao, R. (2000). Closet: An efficient algorithm for mining frequent closed itemsets. In DMKD '00: Proceedings of the 2000 ACM SIGMOD workshop on research issues in Data Mining and Knowledge Discovery, pages 21-30, New York, NY, USA. ACM.
-
(2000)
DMKD '00: Proceedings of the 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery
, pp. 21-30
-
-
Pei, J.1
Han, J.2
Mao, R.3
-
25
-
-
0035016443
-
Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth
-
Washington, DC, USA. IEEE Computer Society
-
Pei, J., Han, J., Mortazavi-asl, B., Pinto, H., Chen, Q., Dayal, U., and chun Hsu, M. (2001). Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE '01: Proceedings of the 2001 International Conference on Data Engineering, page 215, Washington, DC, USA. IEEE Computer Society.
-
(2001)
ICDE '01: Proceedings of the 2001 International Conference on Data Engineering
, pp. 215
-
-
Pei, J.1
Han, J.2
Mortazavi-Asl, B.3
Pinto, H.4
Chen, Q.5
Dayal, U.6
Chun Hsu, M.7
-
26
-
-
57349117605
-
Learning to classify short and sparse text & web with hidden topics from large-scale data collections
-
New York, NY, USA. ACM
-
Phan, X.-H., Nguyen, L.-M., and Horiguchi, S. (2008). Learning to classify short and sparse text & web with hidden topics from large-scale data collections. In WWW '08: Proceeding of the 17th international conference on World Wide Web, pages 91-100, New York, NY, USA. ACM.
-
(2008)
WWW '08: Proceeding of the 17th International Conference on World Wide Web
, pp. 91-100
-
-
Phan, X.-H.1
Nguyen, L.-M.2
Horiguchi, S.3
-
30
-
-
57349120510
-
Modeling online reviews with multi-grain topic models
-
New York, NY, USA. ACM
-
Titov, I. and McDonald, R. (2008b). Modeling online reviews with multi-grain topic models. In WWW '08: Proceedings of the 2008 international conference on World Wide Web, pages 111-120, New York, NY, USA. ACM.
-
(2008)
WWW '08: Proceedings of the 2008 International Conference on World Wide Web
, pp. 111-120
-
-
Titov, I.1
McDonald, R.2
-
32
-
-
49749087162
-
Topical n-grams: Phrase and topic discovery, with an application to information retrieval
-
Washington, DC, USA. IEEE Computer Society
-
Wang, X., McCallum, A., and Wei, X. (2007). Topical n-grams: Phrase and topic discovery, with an application to information retrieval. In ICDM '07: Proceedings of the 2007 IEEE International Conference on Data Mining, pages 697-702, Washington, DC, USA. IEEE Computer Society.
-
(2007)
ICDM '07: Proceedings of the 2007 IEEE International Conference on Data Mining
, pp. 697-702
-
-
Wang, X.1
McCallum, A.2
Wei, X.3
-
33
-
-
33750327222
-
Lda-based document models for ad-hoc retrieval
-
New York, NY, USA. ACM
-
Wei, X. and Croft, W. B. (2006). Lda-based document models for ad-hoc retrieval. In SIGIR '06: Proceedings of the 2006 international ACM SIGIR conference on research and development in Information Retrieval, pages 178-185, New York, NY, USA. ACM.
-
(2006)
SIGIR '06: Proceedings of the 2006 International ACM SIGIR Conference on Research and Development in Information Retrieval
, pp. 178-185
-
-
Wei, X.1
Croft, W.B.2
-
34
-
-
33745458995
-
Mining compressed frequent-pattern sets
-
VLDB Endowment
-
Xin, D., Han, J., Yan, X., and Cheng, H. (2005). Mining compressed frequent-pattern sets. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 709-720. VLDB Endowment.
-
(2005)
VLDB '05: Proceedings of the 31st International Conference on Very Large Data Bases
, pp. 709-720
-
-
Xin, D.1
Han, J.2
Yan, X.3
Cheng, H.4
-
35
-
-
4444326044
-
Clospan: Mining closed sequential patterns in large datasets
-
SIAM
-
Yan, X., Han, J., and Afshar, R. (2003). Clospan: Mining closed sequential patterns in large datasets. In SDM '03: Proceedings of the 2003 SIAM international conference on Data Mining, pages 166-177. SIAM.
-
(2003)
SDM '03: Proceedings of the 2003 SIAM International Conference on Data Mining
, pp. 166-177
-
-
Yan, X.1
Han, J.2
Afshar, R.3
-
36
-
-
0034826102
-
Spade: An efficient algorithm for mining frequent sequences
-
Zaki, M. J. (2001). Spade: An efficient algorithm for mining frequent sequences. Machine Learning, 42(1-2):31-60.
-
(2001)
Machine Learning
, vol.42
, Issue.1-2
, pp. 31-60
-
-
Zaki, M.J.1
-
37
-
-
0347709684
-
Charm: An efficient algorithm for closed itemset mining
-
Arlington, VA, USA. SIAM
-
Zaki, M. J. and jui Hsiao, C. (2002). Charm: An efficient algorithm for closed itemset mining. In SDM '02: Proceedings of the 2002 SIAM international conference on Data Mining, pages 457-473, Arlington, VA, USA. SIAM.
-
(2002)
SDM '02: Proceedings of the 2002 SIAM International Conference on Data Mining
, pp. 457-473
-
-
Zaki, M.J.1
Jui Hsiao, C.2
|