Text feature selection and clustering Based on hybridized gray wolf Optimization grasshopper optimization Algorithm

dc.contributor.guideRajagopalan, S P and Selvakumar, S
dc.coverage.spatialText feature selection and clustering Based on hybridized gray wolf Optimization grasshopper optimization Algorithm
dc.creator.researcherPurushothaman, R
dc.date.accessioned2023-01-30T05:43:12Z
dc.date.available2023-01-30T05:43:12Z
dc.date.awarded2021
dc.date.completed2021
dc.date.registered
dc.description.abstractData mining refers to the extraction of knowledge from large data. It newlineextracts patterns and develops relationships from various unrefined data and newlinemakes use of diverse tools of investigation. The different websites along with the newlineother types of computerized implementation have been offering plenty of text newlineinformation. With regard to efficiently making use of various details, text newlineinformation has to be divided owing to the growth in the use of such newlineapplications. There are transcripts that have been categorized according to their newlineprovenance with plenty of information that is in the form of saving texts on newlinedigital documents. The strategies of text clustering have been used extensively newlinefor categorizing the formation of texts. Text clusters are further used along with newlinetext mining implementation, text classification, and retrieval of text information. newlineFor all other areas of text mining, they may be specific to the field of clustering newlineof text documents which can be a hurdle to the techniques of text analysis. newlineThe main purpose of the feature selection process is to remove newlineunwanted information from a feature set. In the initial stage of work, the Fuzzy newlineC Means (FCM) and K-Means clustering, Correlation Based Feature Selection newline(CFS) and Mutual Information (MI) based feature selection method and Particle newlineSwarm Optimization (PSO) algorithm are evaluated. FCM clustering is newlinefrequently used in pattern recognition; it allows one piece of data to belong to newlinetwo or more clusters. The K-means algorithm, a widely used flat clustering newlinealgorithm, minimizes the average distance of documents from their cluster newlinecenters. newline
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions21cm
dc.format.extentxiv,125p.
dc.identifier.urihttp://hdl.handle.net/10603/454278
dc.languageEnglish
dc.publisher.institutionFaculty of Information and Communication Engineering
dc.publisher.placeChennai
dc.publisher.universityAnna University
dc.relationp.113-124
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordEngineering and Technology
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Information Systems
dc.subject.keywordFeature Selection
dc.subject.keywordPreprocessing steps
dc.subject.keywordText Clustering
dc.titleText feature selection and clustering Based on hybridized gray wolf Optimization grasshopper optimization Algorithm
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 11
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
158.99 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
3.27 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_content.pdf
Size:
87.4 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
166.51 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter 1.pdf
Size:
256.37 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: