Frequent Item-sets Based on Document Clustering Using k-means Algorithm
Abstract & Details
Research Area
computer engineering
Keywords
Text Mining
Text Document
Frequent Item sets
clustering
k-means algorithm
Abstract
The amount of text data stored in computer repositories is growing every day, we need more than ever a reliable way to assemble or classify text documents. Clustering can provide a means of introducing some form of organization to the data, which can also serve to highlight significant patterns and trends. Document clustering is used in many fields such as data mining and information retrieval. Text clustering is the method of combining text or documents which are similar and dissimilar to one another. In several text tasks, this text mining is used such as extraction of information and concept/entity, summarization of documents, modeling of relation with entity, categorization/classification and clustering. Frequent item sets for text clustering we measure the mutual overlap of frequent sets with respect to the sets of supporting documents.
License
This work is licensed under a Creative
Commons
Attribution-ShareAlike 4.0 International License.
Author Information
| # | Name | Institute / Affiliation |
|---|---|---|
| 1 | Jainee Shaileshkumar patel | L. J. Institute of Engineering and Technology |
| 2 | Krunal Panchal | L. J. Institute of Engineering and Technology |
How to Cite
Use the following formats to cite this article in your research.
APA Style
patel, Jainee Shaileshkumar & Panchal, Krunal (2016). Frequent Item-sets Based on Document Clustering Using k-means Algorithm. International Journal of Advance Research and Innovative Ideas In Education, 2(3), 1927-1934.
MLA Style
patel, Jainee Shaileshkumar, and Krunal Panchal. "Frequent Item-sets Based on Document Clustering Using k-means Algorithm." International Journal of Advance Research and Innovative Ideas In Education, vol. 2, no. 3, 2016, pp. 1927-1934.
IEEE Style
Jainee Shaileshkumar patel and Krunal Panchal, "Frequent Item-sets Based on Document Clustering Using k-means Algorithm," International Journal of Advance Research and Innovative Ideas In Education, vol. 2, no. 3, pp. 1927-1934, 2016.
Vancouver Style
patel Jainee Shaileshkumar, Panchal Krunal. Frequent Item-sets Based on Document Clustering Using k-means Algorithm. International Journal of Advance Research and Innovative Ideas In Education. 2016;2(3):1927-1934.
Harvard Style
patel, Jainee Shaileshkumar & Panchal, Krunal (2016) 'Frequent Item-sets Based on Document Clustering Using k-means Algorithm', International Journal of Advance Research and Innovative Ideas In Education, 2(3), pp. 1927-1934.
Chicago Style
patel, Jainee Shaileshkumar and Krunal Panchal. "Frequent Item-sets Based on Document Clustering Using k-means Algorithm." International Journal of Advance Research and Innovative Ideas In Education 2, no. 3 (2016): 1927-1934.
Turabian Style
patel, Jainee Shaileshkumar and Krunal Panchal. "Frequent Item-sets Based on Document Clustering Using k-means Algorithm." International Journal of Advance Research and Innovative Ideas In Education 2, no. 3 (2016): 1927-1934.
Related Research
Comprehensive Review of Existing Chatbot Systems for Career Assistance, Resume Support, and ATS-Aware Guidance
PDF Unavailable
Development of an AI-Powered Multimodal Web Assistant with Intelligent Resume Building and ATS Enhancement
PDF Unavailable
A Deep Learning-Based Framework for Mood-Oriented Music Recommendation Using Facial Expression Analysis
PDF Unavailable
Survey On : Intelligent Payroll and Human Resource Management Systems: A Systematic Review of Automation, Security, and Analytics
PDF Unavailable
Civic Engagement & Empowerment Platform
PDF Unavailable
Recent Developments in Microneedle Technology and Its Diverse Biomedical Applications
PDF Unavailable
RAG System Development with Pydantic AI ChromaDB & Groq
PDF Unavailable
Machine Learning Based Early Stage Diabetes Detection System
PDF Unavailable
A Survey on Skillsense:AI Career Analyzer App
PDF Unavailable
Employee Performance Portal
PDF Unavailable