• ISSN: 2349-6002
  • UGC Approved Journal No 47859

An Optimal Best Keyword Cover Search

  • Unique Paper ID: 144645
  • Volume: 3
  • Issue: 2
  • PageNo: 265-268
  • 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.
email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 3
  • Issue: 2
  • PageNo: 265-268

An Optimal Best Keyword Cover Search

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry