Capacity-constrained query formulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6273 LNCS, Issue , 2010, Pages 384-388

  Hagen, Matthias ^a   Stein, Benno Maria ^a  

^a BAUHAUS UNIVERSITY WEIMAR   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CO-OCCURRENCE PROBABILITY; HEURISTIC SEARCH STRATEGY; PLAGIARISM DETECTION; QUERY FORMULATION;

QUERY PROCESSING; SECURITY OF DATA; WORLD WIDE WEB;

DIGITAL LIBRARIES;

EID: 78049400383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15464-5_38     Document Type: Conference Paper

References (4)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of VLDB 1994, pp. 487-499 (1994)
2. Barker, K., Cornacchia, N.: Using noun phrase heads to extract document keyphrases. In: Proc. of AI 2000, pp. 40-52 (2000)
3. Pôssas, B., Ziviani, N., Ribeiro-Neto, B. A., Meira Jr., W.: Maximal termsets as a query structuring mechanism. In: Proc. of CIKM 2005, pp. 287-288 (2005)
4. Shapiro, J., Taksa, I.: Constructing web search queries from the user's information need expressed in a natural language. In: Matsui, M., Zuccherato, R. J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 1157-1162. Springer, Heidelberg (2004)