Measure-driven keyword-query expansion

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 121-132

  Sarkas, Nikos ^a   Bansal, Nilesh ^a   Das, Gautam ^b   Koudas, Nick ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; EXPANSION;

COMPUTATIONALLY EFFICIENT; OPTIMIZATION PRINCIPLE; PERFORMANCE BENEFITS; PROGRESSIVE REFINEMENT; STORAGE REQUIREMENTS; TEXTUAL INFORMATION; USER-GENERATED CONTENT; WORD CO-OCCURRENCE;

DIGITAL STORAGE;

EID: 78651305414     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687642     Document Type: Article

References (20)

1. N. Bansal, F. Chiang, N. Koudas, and F. W. Tompa. Seeking stable clusters in the blogosphere. In VLDB, 2007.
2. Z. Bar-Yossef and M. Gurevich. Mining search engine query logs via suggestion sampling. PVLDB, 1(1), 2008.
3. O. Ben-Yitzhak, N. Golbandi, N. Har'El, R. Lempel, A. Neumann, S. Ofek-Koifman, D. Sheinwald, E. J. Shekita, B. Sznajder, and S. Yogev. Beyond basic faceted search. In WSDM, 2008.
4. R. G. Bland, D. Goldfarb, and M. J. Todd. The ellipsoid method: A survey. Operations Research, 29(6), 1981.
5. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 1st edition, 2004.
6. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In SIGMOD Conference, 1997.
7. S. Chaudhuri and U. Dayal. An overview of data warehousing and olap technology. SIGMOD Record, 26(1), 1997.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley-Interscience, 2nd edition, 2006.
9. W. Dakka, P. G. Ipeirotis, and K. R. Wood. Automatic construction of multifaceted browsing interfaces. In CIKM, 2005.
10. W. DuMouchel and D. Pregibon. Empirical bayes screening for multi-item associations. In KDD, 2001.
11. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
12. C. Faloutsos, H. V. Jagadish, and N. Sidiropoulos. Recovering information from summary data. In VLDB, 1997.
13. V. Markl, N. Megiddo, M. Kutsch, T. M. Tran, P. J. Haas, and U. Srivastava. Consistently estimating the selectivity of conjuncts of predicates. In VLDB, 2005.
14. T. Palpanas, N. Koudas, and A. O. Mendelzon. Using datacube aggregates for approximate querying and deviation detection. IEEE Trans. Knowl. Data Eng., 17(11), 2005.
15. B. Pang, L. Lee, and S. Vaithyanathan. Thumbs up? sentiment classification using machine learning techniques. CoRR, cs.CL/0205070, 2002.
16. D. Pavlov, H. Mannila, and P. Smyth. Probabilistic models for query approximation with large sparse binary data sets. In UAI, 2000.
17. See homepage for details. Atlas homepage. http://math-atlas.sourceforge.net/.
18. A. Silberschatz and A. Tuzhilin. On subjective measures of interestingness in knowledge discovery. In KDD, 1995.
19. A. Simitsis, A. Baid, Y. Sismanis, and B. Reinwald. Multidimensional content exploration. PVLDB, 1(1), 2008.
20. G. Strang. Linear Algebra and its Applications. Brooks Cole, 4th edition, 2005.