An Optimal Best Keyword Cover Search

An Optimal Best Keyword Cover Search
Author(s):
K. Swathi
Keywords:
Spatial -database, point of the interests, query keywords, keyword ratings, key-word cover.
Abstract
From latter few years, keyword rating increases its availability andr ank in object evaluation for the decision making. This is the main motive for developing this new algorithm called Best keyword cover which is deliberates inter distance as well as the rating provided by the customers through the online business review sites. Closest keyword search algorithm combines the objects from various query keywords to a generate candidate keyword cover. Two algorithms Base-line algorithm and key word n earest-neighbor expansion algorithms are used to finding best keyword cover. The performance of the closest keyword algorithm drops vividly, when the number of query keyword increases. The solution of this problem of the existing algorithm, this work proposes generic version called keyword nearest neighbor expansion which decreases ther esulted candidate key-word covers.
Article Details
Unique Paper ID: 144645 Publication Volume & Issue: Volume 3, Issue 2 Page(s): 265 - 268
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org