Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Searching Comparatively Better Result From Agglomerative algorithm

Author : Dipalee Prakash More 1 Prof. Ujawala M Patil 2

Date of Publication :16th August 2017

Abstract: In this world the Internet has become very casual for searching, the user appears to use it every time, even they need to search keyword from any information query, search relevant word and a lot more. Also, people use search engine like Google, Bing when they are willing to search something, wants to use some relevant information or go to their synonyms. But searching for correct result requires more time and less execution speed even they produce multiple choices. So, this process is very confusing for users to decide one correct keyword amid the many results as a seek engine show overall results. For these reasons, the present paper centering on generally showing the final result and to show exact keyword. Intended to the agglomerative algorithmic approach is used which aim to generate exact keyword in less time and reducing computational cost. The agglomerative approach is very useful for knowing the best result from requiring query candidate.

Reference :

    1. Y. Chen, W. Wang, Z. Liu, and X. Lin. 2009.Keyword search on structured and semi-structured data, in SIGMODConference, pp:b1005–1010.
    2. L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. 2003.Xrank: Ranked keyword search over xml documents, in SIGMOD Conference, pp:16–27
    3. C. Sun, C. Y. Chan, and A. K. Goenka.2007.Multiwayslcabased keyword search in xml data, in WWW, pp:1043–1052.
    4. Y. Xu and Y. Papakonstantinou.2005.Efficient keyword search for smallest lcas in xml databases, in SIGMOD Conference, pp: 537–538.
    5. C. L. A. Clarke, M. Kolla, G. V. Cormack, O. Vechtomova,A. Ashkan, S. Buttcher, and I. MacKinnon.2008.Novelty and diversity in information retrieval evaluation, in SIGIR, pp:659–666.
    6. E. Demidova, P. Fankhauser, X. Zhou, and W. Nejdl. 2010. DivQ:Diversification for keyword search over structured databases, inProc. SIGIR, pp:331–338.
    7. D. Mullner.2011.Modern Hierarchical Agglomerative clustering algorithm in arXiv:1109.2378vl.
    8. N. Slonim and N. Tishby, Agglomerative Aglorithm Bottlneck.
    9. K. Sasirekha and P. Baby. 2013.Agglomerative Hierarchical clustering algorithm: A Review, in IJSRP, vol. 3, Issue 3,pp:1-3.
    10. M. Hasan, A. Mueen, V. J. Tsotras, and E. J. Keogh. 2012. Diversifying query results on semi-structured data, in CIKM, pp:2099–2103.
    11. http://dblp.uni-trier.de/xml/.
    12. http://monetdb.cwi.nl/xml/.
    13. A. Angel and N. Koudas. 2011. Efficient diversityaware search, in SIGMOD Conference, pp: 781–79.

Recent Article