Estimating entity importance via counting set covers

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 687-695

  Gionis, Aristides ^a   Lappas, Theodoros ^b   Terzi, Evimaria ^b  

^a YAHOO RESEARCH   (Spain)

^b BOSTON UNIVERSITY   (United States)

Author keywords

counting; importance sampling; set cover

Indexed keywords

COUNTING; DATA SETS; EXPERIMENTAL EVALUATION; HIGH QUALITY; MINIMUM SET COVER; NEAR-OPTIMAL SOLUTIONS; RANKING AND SELECTION; RANKING METHODS; SELECTION METHODS; SET COVER; USER STUDY;

ALGORITHMS; IMPORTANCE SAMPLING;

DATA MINING;

EID: 84866017484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339640     Document Type: Conference Paper

References (26)

1. F. N. Afrati, A. Gionis, and H. Mannila. Approximating a collection of frequent sets. In KDD, 2004.
2. A. Anagnostopoulos, L. Becchetti, C. Castillo, A. Gionis, and S. Leonardi. Power in unity: forming teams in large-scale community systems. In CIKM, 2010.
3. J. Bailey, T. Manoukian, and K. Ramamohanarao. A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In ICDM, 2003.
4. C. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
5. S.-J. Chen and L. Lin. Modeling team member characteristics for the formation of a multifunctional team in concurrent engineering. IEEE Transactions on Engineering Management, 51(2), 2004.
6. V. Dahllöf, P. Jonsson, and M. Wahlström. Counting models for 2sat and 3sat formulae. TCS, 332(1-3), 2005.
7. P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. TCS, 351, 2006.
8. P. Damaschke and L. Molokov. The union of minimal hitting sets: Parameterized combinatorial bounds and counting. J. Discrete Algorithms, 7(4), 2009.
9. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput., 24, 1995.
10. J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM J. of Computing, 33(4), 2004.
11. W. K. Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 1970.
12. C. Hébert, A. Bretto, and B. Crémilleux. A data mining formalization to improve hypergraph minimal transversal computation. Fundam. Inf., 80, 2007.
13. M. Hu and B. Liu. Mining opinion features in customer reviews. In AAAI, 2004.
14. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
15. M. G. Kendall. A New Measure of Rank Correlation. Biometrika, 30(1/2), 1938.
16. T. Lappas and D. Gunopulos. Efficient confident search in large review corpora. In ECMLPKDD, 2010.
17. T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, 2009.
18. T. Lappas and E. Terzi. Toward a fair review-management system. In ECMLPKDD, 2011.
19. J. Liu, Y. Cao, C. Y. Lin, Y. Huang, and M. Zhou. Low-Quality Product Review Detection in Opinion Summarization. In EMNLP-CoNLL, 2007.
20. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. The Journal of Chemical Physics, 21(6), 1953.
21. T. Mielikäinen and H. Mannila. The pattern ordering problem. In PKDD, 2003.
22. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
23. P. Tsaparas, A. Ntoulas, and E. Terzi. Selecting a comprehensive set of reviews. In KDD, 2011.
24. V. Vazirani. Approximation Algorithms. Springer, 2003.
25. H. Wi, S. Oh, J. Mun, and M. Jung. A team formation model based on knowledge and collaboration. Expert Syst. Appl., 36(5), 2009.
26. A. Zzkarian and A. Kusiak. Forming teams: an analytical approach. IIE Transactions, 31, 2004.