@article{Lally/etal:03,
	title = {The use of dynamic contexts to improve casual internet searching},
	abstract = {Research has shown that most users' online information
searches are suboptimal. Query optimization based on a relevance
feedback or genetic algorithm using dynamic query contexts can help
casual users search the Internet. These algorithms can draw on implicit
user feedback based on the surrounding links and text in a search engine
result set to expand user queries with a variable number of keywords in
two manners. Positive expansion adds terms to a user's keywords with a
Boolean and, negative expansion adds terms to the user's keywords with a
Boolean not. Each algorithm was examined for three user groups, high,
middle, and low achievers, who were classified according to their
overall performance. The interactions of users with different levels of
expertise with different expansion types or algorithms were evaluated. 
The genetic algorithm with negative expansion tripled recall and doubled
precision for low achievers, but high achievers displayed an opposed
trend and seemed to be hindered in this condition. The effect of other
conditions was less substantial.},
	journal = {ACM Transactions on Information Systems},
	author = {Lally, Ann M and Leroy, Gondy and Chen, Hsinchun},
	year = {2003},
	note = {Series Number: 3},
	pages = {229--253},
}

{"_id":"bcRbHN659eYhyy4g9","bibbaseid":"lally-leroy-chen-theuseofdynamiccontextstoimprovecasualinternetsearching-2003","author_short":["Lally, A. M","Leroy, G.","Chen, H."],"bibdata":{"bibtype":"article","type":"article","title":"The use of dynamic contexts to improve casual internet searching","abstract":"Research has shown that most users' online information searches are suboptimal. Query optimization based on a relevance feedback or genetic algorithm using dynamic query contexts can help casual users search the Internet. These algorithms can draw on implicit user feedback based on the surrounding links and text in a search engine result set to expand user queries with a variable number of keywords in two manners. Positive expansion adds terms to a user's keywords with a Boolean and, negative expansion adds terms to the user's keywords with a Boolean not. Each algorithm was examined for three user groups, high, middle, and low achievers, who were classified according to their overall performance. The interactions of users with different levels of expertise with different expansion types or algorithms were evaluated. The genetic algorithm with negative expansion tripled recall and doubled precision for low achievers, but high achievers displayed an opposed trend and seemed to be hindered in this condition. The effect of other conditions was less substantial.","journal":"ACM Transactions on Information Systems","author":[{"propositions":[],"lastnames":["Lally"],"firstnames":["Ann","M"],"suffixes":[]},{"propositions":[],"lastnames":["Leroy"],"firstnames":["Gondy"],"suffixes":[]},{"propositions":[],"lastnames":["Chen"],"firstnames":["Hsinchun"],"suffixes":[]}],"year":"2003","note":"Series Number: 3","pages":"229–253","bibtex":"@article{Lally/etal:03,\n\ttitle = {The use of dynamic contexts to improve casual internet searching},\n\tabstract = {Research has shown that most users' online information\nsearches are suboptimal. Query optimization based on a relevance\nfeedback or genetic algorithm using dynamic query contexts can help\ncasual users search the Internet. These algorithms can draw on implicit\nuser feedback based on the surrounding links and text in a search engine\nresult set to expand user queries with a variable number of keywords in\ntwo manners. Positive expansion adds terms to a user's keywords with a\nBoolean and, negative expansion adds terms to the user's keywords with a\nBoolean not. Each algorithm was examined for three user groups, high,\nmiddle, and low achievers, who were classified according to their\noverall performance. The interactions of users with different levels of\nexpertise with different expansion types or algorithms were evaluated. \nThe genetic algorithm with negative expansion tripled recall and doubled\nprecision for low achievers, but high achievers displayed an opposed\ntrend and seemed to be hindered in this condition. The effect of other\nconditions was less substantial.},\n\tjournal = {ACM Transactions on Information Systems},\n\tauthor = {Lally, Ann M and Leroy, Gondy and Chen, Hsinchun},\n\tyear = {2003},\n\tnote = {Series Number: 3},\n\tpages = {229--253},\n}\n\n","author_short":["Lally, A. M","Leroy, G.","Chen, H."],"key":"Lally/etal:03","id":"Lally/etal:03","bibbaseid":"lally-leroy-chen-theuseofdynamiccontextstoimprovecasualinternetsearching-2003","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/ifromm","dataSources":["N4kJAiLiJ7kxfNsoh"],"keywords":[],"search_terms":["use","dynamic","contexts","improve","casual","internet","searching","lally","leroy","chen"],"title":"The use of dynamic contexts to improve casual internet searching","year":2003}