IEEE Style Citation: Ch. Navya, D. VijayaLakshmi, “Clustering and Text Mining based on Search Engine,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.621-623, 2019.
MLA Style Citation: Ch. Navya, D. VijayaLakshmi "Clustering and Text Mining based on Search Engine." International Journal of Computer Sciences and Engineering 7.3 (2019): 621-623.
APA Style Citation: Ch. Navya, D. VijayaLakshmi, (2019). Clustering and Text Mining based on Search Engine. International Journal of Computer Sciences and Engineering, 7(3), 621-623.
BibTex Style Citation:
@article{Navya_2019,
author = {Ch. Navya, D. VijayaLakshmi},
title = {Clustering and Text Mining based on Search Engine},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {7},
Issue = {3},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {621-623},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3890},
doi = {https://doi.org/10.26438/ijcse/v7i3.621623}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i3.621623}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3890
TI - Clustering and Text Mining based on Search Engine
T2 - International Journal of Computer Sciences and Engineering
AU - Ch. Navya, D. VijayaLakshmi
PY - 2019
DA - 2019/03/31
PB - IJCSE, Indore, INDIA
SP - 621-623
IS - 3
VL - 7
SN - 2347-2693
ER -
VIEWS
PDF
XML
207
139 downloads
101 downloads
Abstract
The time spent by clients are very nearly at least two hours searching for papers that reduces the opportunity to make an internet searcher to improve and exactness in the outcomes. The Proposed work is to compose examine papers, utilizing a database of information related with the themes of programming, databases and working frameworks. Utilizing Clustering method the database is made for the required hunt. There are various grouping calculations, for example, progressive bunching, self-sorting out maps, K-means grouping, etc. In this paper, we propose a bunching calculation that look into the archives with common dialect contained and get the best expressions of their substance to frame a database information that the initial step to get the ideal learning. We actualized the framework utilizing the K-implies bunching calculation. Also the future work utilizes the web search tool to influence quests to order the data presented by the last client and seeking in the correct group.
Key-Words / Index Term
Search Engine, Knowledge Base, Key Text Mining, Mining.
VIEWS
PDF 
XML 
