DocumentCode
2985554
Title
Auto complete using graph mining: A different approach
Author
Agrawal, Neeraj ; Swain, Mrutyunjaya
Author_Institution
Comput. Sci. & Eng., Univ. of South Carolina, Columbia, SC, USA
fYear
2011
fDate
17-20 March 2011
Firstpage
268
Lastpage
271
Abstract
Autocomplete feature is widely used in search interfaces to assist users in their search. Autocomplete helps users by giving list of options based on characters entered in the search field. Significant amount of work has been done in this field, but the techniques used are not efficient or relevant when it comes to search within specific content like a text file, a document or a web page. This calls for different approaches such as ours. Our proposed method is based on preprocessing, graph mining, and hashing for generating the suggestion list. The suggestion list provided by our proposed method is more relevant because the list is document specific. Test results from our proposed method show that our proposed method significantly outperforms existing document specific autocomple search techniques.
Keywords
data mining; graph theory; information retrieval; autocomplete feature; document specific autocomplete search techniques; graph mining; hashing; search interfaces; Clustering algorithms; Data mining; Databases; Electronic mail; History; Program processors; Web pages; autocomplete; graph mining; hashing; pre-processing; sentence completion;
fLanguage
English
Publisher
ieee
Conference_Titel
Southeastcon, 2011 Proceedings of IEEE
Conference_Location
Nashville, TN
ISSN
1091-0050
Print_ISBN
978-1-61284-739-9
Type
conf
DOI
10.1109/SECON.2011.5752947
Filename
5752947
Link To Document