A Survey on Keyword Interrogation Implication on Document Vicinity Based on Location
Akshay A. Bhujugade, Dattatraya V. Kodavade , , ,
Affiliations A Survey on Keyword Interrogation Implication on Document Vicinity Based on Location
:10.22362/ijcert/2017/v4/i11/xxxx [UNDER PROCESS]
Keyword suggestions are the basic feature of the search engine and it accesses relevant information. The naive user doesnâ€™t know how to express their queries; keyword suggestion in web search assists users to access relevant information without any prior knowledge of how to express in queries. The keyword suggestion module can use the current location of a user and retrieve documents which are near to user location. The Euclidean distance is measured for user location and the documents locations. Accordingly the edge weight adjustment is done referring initial K-D graph. The keyword-document graph is used to map the keyword queries and the spatial distance between the resulting documents and the user location. The graph is browsed in random walk with restart, for calculating the highest score for better keyword query suggestion. The paper discusses techniques for the keyword suggestions and also about location-aware keyword query suggestion framework and improved partition based algorithm.
Akshay A. Bhujugade and Dattatraya V. Kodavade (2017). A Survey on Keyword Interrogation Implication on Document Vicinity Based on Location. International Journal of Computer Engineering In Research Trends, 4(11), 514-518. Retrieved from http://ijcert.org/ems/ijcert_papers/V4I1108.pdf
 Shuyao Qi, Dingming Wu, and Nikos Mamoulis â€œLocation Aware Keyword Query Suggestion Based on Document Proximity,â€ IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 28, NO. 1, JANUARY 2016.
 D. Wu, M. L. Yiu, and C. S. Jensen, â€œMoving spatial keyword queries: Formulation, methods, and analysis,â€ ACM Trans. Database Syst., vol. 38, no. 1, pp. 7:1â€“7:47, 2013.
 Y. Lu, J. Lu, G. Cong, W. Wu, and C. Shahabi, â€œEfficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search,â€ ACM Trans. Database Syst., vol. 39, no. 2, pp. 13:1â€“13:46, 2014.
 R. Baeza-Yates, C. Hurtado, and M. Mendoza, â€œQuery recommendation using query logs in search enginesâ€, in Extending Database Technology, pp.588â€“596, 2004.
 P. Berkhin, â€œBookmark-coloring algorithm for personalized pagerank computing,â€ Internet Math., vol. 3, pp. 41â€“62, 2006.
 N. Craswell and M. Szummer, â€œRandom walks on the click graph,â€ in Proc. 30th Annu. Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , pp. 239â€“246, 2007.
 H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li, â€œContext-aware query suggestion by mining click-through and session data,â€ in Proc. 14th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp. 875â€“883,2008.
 M. P. Kato, T. Sakai, and K. Tanaka, â€œWhen do people use query suggestion Inf. Retr., vol. 16, no. 6, pp. 725â€“746, 2013.
 H. Tong, C. Faloutsos, and J.-Y. Pan, â€œFast random walk with restart and its applications,â€ in Proc. 6th Int. Conf. Data Mining, pp. 613â€“622, 2006.
 N. Craswell and M. Szummer, â€œRandom walks on the click graph,â€ in Proc. 30th Annu. Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, pp. 239â€“246, 2007.
 Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa, â€œFast and exact top-k search for random walk with restart,â€ Proc. VLDB Endowment, vol. 5, no. 5, pp. 442â€“453, Jan. 2012.
 V. Swathi ,D. Saidulu , B. Chandrakala,â€ Enabling Secure and Effective Spatial Query Processing on the Cloud using Forward Spatial Transformation,â€ International Journal of Computer Engineering In Research Trends.,vol.4,no.7,pp.301-307, July2017.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.