Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6893
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Palariya, Pawan | - |
dc.contributor.author | Kumar, Yugal [Guided by] | - |
dc.date.accessioned | 2022-09-27T07:10:40Z | - |
dc.date.available | 2022-09-27T07:10:40Z | - |
dc.date.issued | 2019 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6893 | - |
dc.description.abstract | The grouping in classes of similar objects is called the clustering process of a set of physical or abstract objects. The most common type of supervised learning is clustering. For unattended organization of document, automatic extraction of the topic and quick information recall, clustering documents is more specific technique. Rapid, high-quality document clustering algorithms helps users navigate, summarize and organize information effectively. Every day, from the extremes of large or minor portals around the world, we find a large number of documents. The K mean algorithm is the partial clustering algorithm most commonly used. The present work is directed to cluster documents using Self-Organizing Map (SOM), FUZZY C Meaning and K means algorithms. The aim of this study is to divide and data sets into K clusters with a closest significance (Similarity). | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Document clustering | en_US |
dc.subject | Python | en_US |
dc.title | Document Clustering using Python | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | B.Tech. Project Reports |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Document Clustering using Python.pdf | 1.67 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.