Submit Search
Upload
Feature Subset Selection for High Dimensional Data using Clustering Techniques
β’
0 likes
β’
28 views
IRJET Journal
Follow
https://www.irjet.net/archives/V4/i8/IRJET-V4I8140.pdf
Read less
Read more
Engineering
Report
Share
Report
Share
1 of 7
Download now
Download to read offline
Recommended
Feature Subset Selection for High Dimensional Data Using Clustering Techniques
Feature Subset Selection for High Dimensional Data Using Clustering Techniques
IRJET Journal
Β
Fuzzy clustering and fuzzy c-means partition cluster analysis and validation ...
Fuzzy clustering and fuzzy c-means partition cluster analysis and validation ...
IJECEIAES
Β
Cancer data partitioning with data structure and difficulty independent clust...
Cancer data partitioning with data structure and difficulty independent clust...
IRJET Journal
Β
A HYBRID MODEL FOR MINING MULTI DIMENSIONAL DATA SETS
A HYBRID MODEL FOR MINING MULTI DIMENSIONAL DATA SETS
Editor IJCATR
Β
TUPLE VALUE BASED MULTIPLICATIVE DATA PERTURBATION APPROACH TO PRESERVE PRIVA...
TUPLE VALUE BASED MULTIPLICATIVE DATA PERTURBATION APPROACH TO PRESERVE PRIVA...
IJDKP
Β
IRJET- Sampling Selection Strategy for Large Scale Deduplication of Synthetic...
IRJET- Sampling Selection Strategy for Large Scale Deduplication of Synthetic...
IRJET Journal
Β
An Approach to Mixed Dataset Clustering and Validation with ART-2 Artificial ...
An Approach to Mixed Dataset Clustering and Validation with ART-2 Artificial ...
Happiest Minds Technologies
Β
Ijartes v1-i2-006
Ijartes v1-i2-006
IJARTES
Β
Recommended
Feature Subset Selection for High Dimensional Data Using Clustering Techniques
Feature Subset Selection for High Dimensional Data Using Clustering Techniques
IRJET Journal
Β
Fuzzy clustering and fuzzy c-means partition cluster analysis and validation ...
Fuzzy clustering and fuzzy c-means partition cluster analysis and validation ...
IJECEIAES
Β
Cancer data partitioning with data structure and difficulty independent clust...
Cancer data partitioning with data structure and difficulty independent clust...
IRJET Journal
Β
A HYBRID MODEL FOR MINING MULTI DIMENSIONAL DATA SETS
A HYBRID MODEL FOR MINING MULTI DIMENSIONAL DATA SETS
Editor IJCATR
Β
TUPLE VALUE BASED MULTIPLICATIVE DATA PERTURBATION APPROACH TO PRESERVE PRIVA...
TUPLE VALUE BASED MULTIPLICATIVE DATA PERTURBATION APPROACH TO PRESERVE PRIVA...
IJDKP
Β
IRJET- Sampling Selection Strategy for Large Scale Deduplication of Synthetic...
IRJET- Sampling Selection Strategy for Large Scale Deduplication of Synthetic...
IRJET Journal
Β
An Approach to Mixed Dataset Clustering and Validation with ART-2 Artificial ...
An Approach to Mixed Dataset Clustering and Validation with ART-2 Artificial ...
Happiest Minds Technologies
Β
Ijartes v1-i2-006
Ijartes v1-i2-006
IJARTES
Β
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147
Editor IJARCET
Β
Comparison of Text Classifiers on News Articles
Comparison of Text Classifiers on News Articles
IRJET Journal
Β
IRJET - Survey on Clustering based Categorical Data Protection
IRJET - Survey on Clustering based Categorical Data Protection
IRJET Journal
Β
Principle Component Analysis Based on Optimal Centroid Selection Model for Su...
Principle Component Analysis Based on Optimal Centroid Selection Model for Su...
ijtsrd
Β
Volume 14 issue 03 march 2014_ijcsms_march14_10_14_rahul
Volume 14 issue 03 march 2014_ijcsms_march14_10_14_rahul
Deepak Agarwal
Β
Experimental study of Data clustering using k- Means and modified algorithms
Experimental study of Data clustering using k- Means and modified algorithms
IJDKP
Β
Combined mining approach to generate patterns for complex data
Combined mining approach to generate patterns for complex data
csandit
Β
COMBINED MINING APPROACH TO GENERATE PATTERNS FOR COMPLEX DATA
COMBINED MINING APPROACH TO GENERATE PATTERNS FOR COMPLEX DATA
cscpconf
Β
Survey on Efficient Techniques of Text Mining
Survey on Efficient Techniques of Text Mining
vivatechijri
Β
Extended pso algorithm for improvement problems k means clustering algorithm
Extended pso algorithm for improvement problems k means clustering algorithm
IJMIT JOURNAL
Β
A Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means Algorithm
IRJET Journal
Β
IRJET- Missing Data Imputation by Evidence Chain
IRJET- Missing Data Imputation by Evidence Chain
IRJET Journal
Β
IRJET- Diverse Approaches for Document Clustering in Product Development Anal...
IRJET- Diverse Approaches for Document Clustering in Product Development Anal...
IRJET Journal
Β
10 Algorithms in data mining
10 Algorithms in data mining
George Ang
Β
Terminology Machine Learning
Terminology Machine Learning
DataminingTools Inc
Β
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithm
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithm
aciijournal
Β
The Use of K-NN and Bees Algorithm for Big Data Intrusion Detection System
The Use of K-NN and Bees Algorithm for Big Data Intrusion Detection System
IOSRjournaljce
Β
IRJET - Random Data Perturbation Techniques in Privacy Preserving Data Mi...
IRJET - Random Data Perturbation Techniques in Privacy Preserving Data Mi...
IRJET Journal
Β
IRJET- Study and Evaluation of Classification Algorithms in Data Mining
IRJET- Study and Evaluation of Classification Algorithms in Data Mining
IRJET Journal
Β
Analysis on different Data mining Techniques and algorithms used in IOT
Analysis on different Data mining Techniques and algorithms used in IOT
IJERA Editor
Β
CLASSIFICATION ALGORITHM USING RANDOM CONCEPT ON A VERY LARGE DATA SET: A SURVEY
CLASSIFICATION ALGORITHM USING RANDOM CONCEPT ON A VERY LARGE DATA SET: A SURVEY
Editor IJMTER
Β
G44093135
G44093135
IJERA Editor
Β
More Related Content
What's hot
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147
Editor IJARCET
Β
Comparison of Text Classifiers on News Articles
Comparison of Text Classifiers on News Articles
IRJET Journal
Β
IRJET - Survey on Clustering based Categorical Data Protection
IRJET - Survey on Clustering based Categorical Data Protection
IRJET Journal
Β
Principle Component Analysis Based on Optimal Centroid Selection Model for Su...
Principle Component Analysis Based on Optimal Centroid Selection Model for Su...
ijtsrd
Β
Volume 14 issue 03 march 2014_ijcsms_march14_10_14_rahul
Volume 14 issue 03 march 2014_ijcsms_march14_10_14_rahul
Deepak Agarwal
Β
Experimental study of Data clustering using k- Means and modified algorithms
Experimental study of Data clustering using k- Means and modified algorithms
IJDKP
Β
Combined mining approach to generate patterns for complex data
Combined mining approach to generate patterns for complex data
csandit
Β
COMBINED MINING APPROACH TO GENERATE PATTERNS FOR COMPLEX DATA
COMBINED MINING APPROACH TO GENERATE PATTERNS FOR COMPLEX DATA
cscpconf
Β
Survey on Efficient Techniques of Text Mining
Survey on Efficient Techniques of Text Mining
vivatechijri
Β
Extended pso algorithm for improvement problems k means clustering algorithm
Extended pso algorithm for improvement problems k means clustering algorithm
IJMIT JOURNAL
Β
A Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means Algorithm
IRJET Journal
Β
IRJET- Missing Data Imputation by Evidence Chain
IRJET- Missing Data Imputation by Evidence Chain
IRJET Journal
Β
IRJET- Diverse Approaches for Document Clustering in Product Development Anal...
IRJET- Diverse Approaches for Document Clustering in Product Development Anal...
IRJET Journal
Β
10 Algorithms in data mining
10 Algorithms in data mining
George Ang
Β
Terminology Machine Learning
Terminology Machine Learning
DataminingTools Inc
Β
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithm
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithm
aciijournal
Β
The Use of K-NN and Bees Algorithm for Big Data Intrusion Detection System
The Use of K-NN and Bees Algorithm for Big Data Intrusion Detection System
IOSRjournaljce
Β
IRJET - Random Data Perturbation Techniques in Privacy Preserving Data Mi...
IRJET - Random Data Perturbation Techniques in Privacy Preserving Data Mi...
IRJET Journal
Β
IRJET- Study and Evaluation of Classification Algorithms in Data Mining
IRJET- Study and Evaluation of Classification Algorithms in Data Mining
IRJET Journal
Β
Analysis on different Data mining Techniques and algorithms used in IOT
Analysis on different Data mining Techniques and algorithms used in IOT
IJERA Editor
Β
What's hot
(20)
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147
Β
Comparison of Text Classifiers on News Articles
Comparison of Text Classifiers on News Articles
Β
IRJET - Survey on Clustering based Categorical Data Protection
IRJET - Survey on Clustering based Categorical Data Protection
Β
Principle Component Analysis Based on Optimal Centroid Selection Model for Su...
Principle Component Analysis Based on Optimal Centroid Selection Model for Su...
Β
Volume 14 issue 03 march 2014_ijcsms_march14_10_14_rahul
Volume 14 issue 03 march 2014_ijcsms_march14_10_14_rahul
Β
Experimental study of Data clustering using k- Means and modified algorithms
Experimental study of Data clustering using k- Means and modified algorithms
Β
Combined mining approach to generate patterns for complex data
Combined mining approach to generate patterns for complex data
Β
COMBINED MINING APPROACH TO GENERATE PATTERNS FOR COMPLEX DATA
COMBINED MINING APPROACH TO GENERATE PATTERNS FOR COMPLEX DATA
Β
Survey on Efficient Techniques of Text Mining
Survey on Efficient Techniques of Text Mining
Β
Extended pso algorithm for improvement problems k means clustering algorithm
Extended pso algorithm for improvement problems k means clustering algorithm
Β
A Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means Algorithm
Β
IRJET- Missing Data Imputation by Evidence Chain
IRJET- Missing Data Imputation by Evidence Chain
Β
IRJET- Diverse Approaches for Document Clustering in Product Development Anal...
IRJET- Diverse Approaches for Document Clustering in Product Development Anal...
Β
10 Algorithms in data mining
10 Algorithms in data mining
Β
Terminology Machine Learning
Terminology Machine Learning
Β
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithm
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithm
Β
The Use of K-NN and Bees Algorithm for Big Data Intrusion Detection System
The Use of K-NN and Bees Algorithm for Big Data Intrusion Detection System
Β
IRJET - Random Data Perturbation Techniques in Privacy Preserving Data Mi...
IRJET - Random Data Perturbation Techniques in Privacy Preserving Data Mi...
Β
IRJET- Study and Evaluation of Classification Algorithms in Data Mining
IRJET- Study and Evaluation of Classification Algorithms in Data Mining
Β
Analysis on different Data mining Techniques and algorithms used in IOT
Analysis on different Data mining Techniques and algorithms used in IOT
Β
Similar to Feature Subset Selection for High Dimensional Data using Clustering Techniques
CLASSIFICATION ALGORITHM USING RANDOM CONCEPT ON A VERY LARGE DATA SET: A SURVEY
CLASSIFICATION ALGORITHM USING RANDOM CONCEPT ON A VERY LARGE DATA SET: A SURVEY
Editor IJMTER
Β
G44093135
G44093135
IJERA Editor
Β
Introduction to feature subset selection method
Introduction to feature subset selection method
IJSRD
Β
Variance rover system web analytics tool using data
Variance rover system web analytics tool using data
eSAT Publishing House
Β
Variance rover system
Variance rover system
eSAT Journals
Β
Hybrid Model using Unsupervised Filtering Based on Ant Colony Optimization an...
Hybrid Model using Unsupervised Filtering Based on Ant Colony Optimization an...
IRJET Journal
Β
Classification Techniques: A Review
Classification Techniques: A Review
IOSRjournaljce
Β
Hypothesis on Different Data Mining Algorithms
Hypothesis on Different Data Mining Algorithms
IJERA Editor
Β
Different Classification Technique for Data mining in Insurance Industry usin...
Different Classification Technique for Data mining in Insurance Industry usin...
IOSRjournaljce
Β
A Threshold fuzzy entropy based feature selection method applied in various b...
A Threshold fuzzy entropy based feature selection method applied in various b...
IJMER
Β
Review of Algorithms for Crime Analysis & Prediction
Review of Algorithms for Crime Analysis & Prediction
IRJET Journal
Β
Clustering of Big Data Using Different Data-Mining Techniques
Clustering of Big Data Using Different Data-Mining Techniques
IRJET Journal
Β
IRJET- Anomaly Detection System in CCTV Derived Videos
IRJET- Anomaly Detection System in CCTV Derived Videos
IRJET Journal
Β
Applying K-Means Clustering Algorithm to Discover Knowledge from Insurance Da...
Applying K-Means Clustering Algorithm to Discover Knowledge from Insurance Da...
theijes
Β
IRJET- A Detailed Study on Classification Techniques for Data Mining
IRJET- A Detailed Study on Classification Techniques for Data Mining
IRJET Journal
Β
AN EFFICIENT FEATURE SELECTION IN CLASSIFICATION OF AUDIO FILES
AN EFFICIENT FEATURE SELECTION IN CLASSIFICATION OF AUDIO FILES
cscpconf
Β
An efficient feature selection in
An efficient feature selection in
csandit
Β
A scenario based approach for dealing with
A scenario based approach for dealing with
ijcsa
Β
MPSKM Algorithm to Cluster Uneven Dimensional Time Series Subspace Data
MPSKM Algorithm to Cluster Uneven Dimensional Time Series Subspace Data
IRJET Journal
Β
Iaetsd an efficient and large data base using subset selection algorithm
Iaetsd an efficient and large data base using subset selection algorithm
Iaetsd Iaetsd
Β
Similar to Feature Subset Selection for High Dimensional Data using Clustering Techniques
(20)
CLASSIFICATION ALGORITHM USING RANDOM CONCEPT ON A VERY LARGE DATA SET: A SURVEY
CLASSIFICATION ALGORITHM USING RANDOM CONCEPT ON A VERY LARGE DATA SET: A SURVEY
Β
G44093135
G44093135
Β
Introduction to feature subset selection method
Introduction to feature subset selection method
Β
Variance rover system web analytics tool using data
Variance rover system web analytics tool using data
Β
Variance rover system
Variance rover system
Β
Hybrid Model using Unsupervised Filtering Based on Ant Colony Optimization an...
Hybrid Model using Unsupervised Filtering Based on Ant Colony Optimization an...
Β
Classification Techniques: A Review
Classification Techniques: A Review
Β
Hypothesis on Different Data Mining Algorithms
Hypothesis on Different Data Mining Algorithms
Β
Different Classification Technique for Data mining in Insurance Industry usin...
Different Classification Technique for Data mining in Insurance Industry usin...
Β
A Threshold fuzzy entropy based feature selection method applied in various b...
A Threshold fuzzy entropy based feature selection method applied in various b...
Β
Review of Algorithms for Crime Analysis & Prediction
Review of Algorithms for Crime Analysis & Prediction
Β
Clustering of Big Data Using Different Data-Mining Techniques
Clustering of Big Data Using Different Data-Mining Techniques
Β
IRJET- Anomaly Detection System in CCTV Derived Videos
IRJET- Anomaly Detection System in CCTV Derived Videos
Β
Applying K-Means Clustering Algorithm to Discover Knowledge from Insurance Da...
Applying K-Means Clustering Algorithm to Discover Knowledge from Insurance Da...
Β
IRJET- A Detailed Study on Classification Techniques for Data Mining
IRJET- A Detailed Study on Classification Techniques for Data Mining
Β
AN EFFICIENT FEATURE SELECTION IN CLASSIFICATION OF AUDIO FILES
AN EFFICIENT FEATURE SELECTION IN CLASSIFICATION OF AUDIO FILES
Β
An efficient feature selection in
An efficient feature selection in
Β
A scenario based approach for dealing with
A scenario based approach for dealing with
Β
MPSKM Algorithm to Cluster Uneven Dimensional Time Series Subspace Data
MPSKM Algorithm to Cluster Uneven Dimensional Time Series Subspace Data
Β
Iaetsd an efficient and large data base using subset selection algorithm
Iaetsd an efficient and large data base using subset selection algorithm
Β
More from IRJET Journal
TUNNELING IN HIMALAYAS WITH NATM METHOD: A SPECIAL REFERENCES TO SUNGAL TUNNE...
TUNNELING IN HIMALAYAS WITH NATM METHOD: A SPECIAL REFERENCES TO SUNGAL TUNNE...
IRJET Journal
Β
STUDY THE EFFECT OF RESPONSE REDUCTION FACTOR ON RC FRAMED STRUCTURE
STUDY THE EFFECT OF RESPONSE REDUCTION FACTOR ON RC FRAMED STRUCTURE
IRJET Journal
Β
A COMPARATIVE ANALYSIS OF RCC ELEMENT OF SLAB WITH STARK STEEL (HYSD STEEL) A...
A COMPARATIVE ANALYSIS OF RCC ELEMENT OF SLAB WITH STARK STEEL (HYSD STEEL) A...
IRJET Journal
Β
Effect of Camber and Angles of Attack on Airfoil Characteristics
Effect of Camber and Angles of Attack on Airfoil Characteristics
IRJET Journal
Β
A Review on the Progress and Challenges of Aluminum-Based Metal Matrix Compos...
A Review on the Progress and Challenges of Aluminum-Based Metal Matrix Compos...
IRJET Journal
Β
Dynamic Urban Transit Optimization: A Graph Neural Network Approach for Real-...
Dynamic Urban Transit Optimization: A Graph Neural Network Approach for Real-...
IRJET Journal
Β
Structural Analysis and Design of Multi-Storey Symmetric and Asymmetric Shape...
Structural Analysis and Design of Multi-Storey Symmetric and Asymmetric Shape...
IRJET Journal
Β
A Review of βSeismic Response of RC Structures Having Plan and Vertical Irreg...
A Review of βSeismic Response of RC Structures Having Plan and Vertical Irreg...
IRJET Journal
Β
A REVIEW ON MACHINE LEARNING IN ADAS
A REVIEW ON MACHINE LEARNING IN ADAS
IRJET Journal
Β
Long Term Trend Analysis of Precipitation and Temperature for Asosa district,...
Long Term Trend Analysis of Precipitation and Temperature for Asosa district,...
IRJET Journal
Β
P.E.B. Framed Structure Design and Analysis Using STAAD Pro
P.E.B. Framed Structure Design and Analysis Using STAAD Pro
IRJET Journal
Β
A Review on Innovative Fiber Integration for Enhanced Reinforcement of Concre...
A Review on Innovative Fiber Integration for Enhanced Reinforcement of Concre...
IRJET Journal
Β
Survey Paper on Cloud-Based Secured Healthcare System
Survey Paper on Cloud-Based Secured Healthcare System
IRJET Journal
Β
Review on studies and research on widening of existing concrete bridges
Review on studies and research on widening of existing concrete bridges
IRJET Journal
Β
React based fullstack edtech web application
React based fullstack edtech web application
IRJET Journal
Β
A Comprehensive Review of Integrating IoT and Blockchain Technologies in the ...
A Comprehensive Review of Integrating IoT and Blockchain Technologies in the ...
IRJET Journal
Β
A REVIEW ON THE PERFORMANCE OF COCONUT FIBRE REINFORCED CONCRETE.
A REVIEW ON THE PERFORMANCE OF COCONUT FIBRE REINFORCED CONCRETE.
IRJET Journal
Β
Optimizing Business Management Process Workflows: The Dynamic Influence of Mi...
Optimizing Business Management Process Workflows: The Dynamic Influence of Mi...
IRJET Journal
Β
Multistoried and Multi Bay Steel Building Frame by using Seismic Design
Multistoried and Multi Bay Steel Building Frame by using Seismic Design
IRJET Journal
Β
Cost Optimization of Construction Using Plastic Waste as a Sustainable Constr...
Cost Optimization of Construction Using Plastic Waste as a Sustainable Constr...
IRJET Journal
Β
More from IRJET Journal
(20)
TUNNELING IN HIMALAYAS WITH NATM METHOD: A SPECIAL REFERENCES TO SUNGAL TUNNE...
TUNNELING IN HIMALAYAS WITH NATM METHOD: A SPECIAL REFERENCES TO SUNGAL TUNNE...
Β
STUDY THE EFFECT OF RESPONSE REDUCTION FACTOR ON RC FRAMED STRUCTURE
STUDY THE EFFECT OF RESPONSE REDUCTION FACTOR ON RC FRAMED STRUCTURE
Β
A COMPARATIVE ANALYSIS OF RCC ELEMENT OF SLAB WITH STARK STEEL (HYSD STEEL) A...
A COMPARATIVE ANALYSIS OF RCC ELEMENT OF SLAB WITH STARK STEEL (HYSD STEEL) A...
Β
Effect of Camber and Angles of Attack on Airfoil Characteristics
Effect of Camber and Angles of Attack on Airfoil Characteristics
Β
A Review on the Progress and Challenges of Aluminum-Based Metal Matrix Compos...
A Review on the Progress and Challenges of Aluminum-Based Metal Matrix Compos...
Β
Dynamic Urban Transit Optimization: A Graph Neural Network Approach for Real-...
Dynamic Urban Transit Optimization: A Graph Neural Network Approach for Real-...
Β
Structural Analysis and Design of Multi-Storey Symmetric and Asymmetric Shape...
Structural Analysis and Design of Multi-Storey Symmetric and Asymmetric Shape...
Β
A Review of βSeismic Response of RC Structures Having Plan and Vertical Irreg...
A Review of βSeismic Response of RC Structures Having Plan and Vertical Irreg...
Β
A REVIEW ON MACHINE LEARNING IN ADAS
A REVIEW ON MACHINE LEARNING IN ADAS
Β
Long Term Trend Analysis of Precipitation and Temperature for Asosa district,...
Long Term Trend Analysis of Precipitation and Temperature for Asosa district,...
Β
P.E.B. Framed Structure Design and Analysis Using STAAD Pro
P.E.B. Framed Structure Design and Analysis Using STAAD Pro
Β
A Review on Innovative Fiber Integration for Enhanced Reinforcement of Concre...
A Review on Innovative Fiber Integration for Enhanced Reinforcement of Concre...
Β
Survey Paper on Cloud-Based Secured Healthcare System
Survey Paper on Cloud-Based Secured Healthcare System
Β
Review on studies and research on widening of existing concrete bridges
Review on studies and research on widening of existing concrete bridges
Β
React based fullstack edtech web application
React based fullstack edtech web application
Β
A Comprehensive Review of Integrating IoT and Blockchain Technologies in the ...
A Comprehensive Review of Integrating IoT and Blockchain Technologies in the ...
Β
A REVIEW ON THE PERFORMANCE OF COCONUT FIBRE REINFORCED CONCRETE.
A REVIEW ON THE PERFORMANCE OF COCONUT FIBRE REINFORCED CONCRETE.
Β
Optimizing Business Management Process Workflows: The Dynamic Influence of Mi...
Optimizing Business Management Process Workflows: The Dynamic Influence of Mi...
Β
Multistoried and Multi Bay Steel Building Frame by using Seismic Design
Multistoried and Multi Bay Steel Building Frame by using Seismic Design
Β
Cost Optimization of Construction Using Plastic Waste as a Sustainable Constr...
Cost Optimization of Construction Using Plastic Waste as a Sustainable Constr...
Β
Recently uploaded
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
Asst.prof M.Gokilavani
Β
Work Experience-Dalton Park.pptxfvvvvvvv
Work Experience-Dalton Park.pptxfvvvvvvv
LewisJB
Β
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
roselinkalist12
Β
POWER SYSTEMS-1 Complete notes examples
POWER SYSTEMS-1 Complete notes examples
Dr. Gudipudi Nageswara Rao
Β
Introduction-To-Agricultural-Surveillance-Rover.pptx
Introduction-To-Agricultural-Surveillance-Rover.pptx
k795866
Β
Oxy acetylene welding presentation note.
Oxy acetylene welding presentation note.
eptoze12
Β
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
9953056974 Low Rate Call Girls In Saket, Delhi NCR
Β
Biology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptx
DeepakSakkari2
Β
pipeline in computer architecture design
pipeline in computer architecture design
ssuser87fa0c1
Β
Heart Disease Prediction using machine learning.pptx
Heart Disease Prediction using machine learning.pptx
PoojaBan
Β
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECH
C Sai Kiran
Β
Concrete Mix Design - IS 10262-2019 - .pptx
Concrete Mix Design - IS 10262-2019 - .pptx
KartikeyaDwivedi3
Β
complete construction, environmental and economics information of biomass com...
complete construction, environmental and economics information of biomass com...
asadnawaz62
Β
young call girls in Rajiv Chowkπ 9953056974 π Delhi escort Service
young call girls in Rajiv Chowkπ 9953056974 π Delhi escort Service
9953056974 Low Rate Call Girls In Saket, Delhi NCR
Β
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
srsj9000
Β
EduAI - E learning Platform integrated with AI
EduAI - E learning Platform integrated with AI
koyaldeepu123
Β
Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024
hassan khalil
Β
Call Girls Narol 7397865700 Independent Call Girls
Call Girls Narol 7397865700 Independent Call Girls
ssuser7cb4ff
Β
Electronically Controlled suspensions system .pdf
Electronically Controlled suspensions system .pdf
me23b1001
Β
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
Asst.prof M.Gokilavani
Β
Recently uploaded
(20)
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
Β
Work Experience-Dalton Park.pptxfvvvvvvv
Work Experience-Dalton Park.pptxfvvvvvvv
Β
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
Β
POWER SYSTEMS-1 Complete notes examples
POWER SYSTEMS-1 Complete notes examples
Β
Introduction-To-Agricultural-Surveillance-Rover.pptx
Introduction-To-Agricultural-Surveillance-Rover.pptx
Β
Oxy acetylene welding presentation note.
Oxy acetylene welding presentation note.
Β
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
Β
Biology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptx
Β
pipeline in computer architecture design
pipeline in computer architecture design
Β
Heart Disease Prediction using machine learning.pptx
Heart Disease Prediction using machine learning.pptx
Β
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECH
Β
Concrete Mix Design - IS 10262-2019 - .pptx
Concrete Mix Design - IS 10262-2019 - .pptx
Β
complete construction, environmental and economics information of biomass com...
complete construction, environmental and economics information of biomass com...
Β
young call girls in Rajiv Chowkπ 9953056974 π Delhi escort Service
young call girls in Rajiv Chowkπ 9953056974 π Delhi escort Service
Β
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Β
EduAI - E learning Platform integrated with AI
EduAI - E learning Platform integrated with AI
Β
Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024
Β
Call Girls Narol 7397865700 Independent Call Girls
Call Girls Narol 7397865700 Independent Call Girls
Β
Electronically Controlled suspensions system .pdf
Electronically Controlled suspensions system .pdf
Β
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
Β
Feature Subset Selection for High Dimensional Data using Clustering Techniques
1.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 809 Feature Subset Selection for High Dimensional Data Using Clustering Techniques Nilam Prakash Sonawale1, Prof. B. W. Balkhande2 1Student of M.E. Computer Engineering, Bharati Vidyapeeth College of Engineering, Mumbai University, Navi Mumbai , Maharashtra, India. 2Assistant Professor, Dept. of Computer Engineering, Bharati Vidyapeeth College of Engineering, Mumbai University, Navi Mumbai, Maharashtra, India ---------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - Data mining is the process of analyzingthedata from different perspective and summarizing it into useful information (Information that can be used to increase revenue, cuts costs or both). Database containslargevolume of attributes or dimensions which are further classified as low dimension data and high dimension data. When dimensionality increases, data in the irrelevant dimension may produce noise, to deal with this problem it is essential to have a feature selection mechanism that can find a subset of features that meets requirement and accomplish high relevance. The proposed algorithm FAST is evaluated in this project. Our proposed FAST algorithm has three steps: (1) Irrelevant features are removed (2) Featuresaredivided in to clusters, (3) Selecting the most representative feature from cluster [8]. FAST algorithm can be performed by DBSCAN (Density-Based Spatial Clustering with Noise) algorithm that can be workedinthedistributedenvironment using the Map Reduce and Hadoop. Small number of discriminative features will be the final result. Key Words: Data Mining, Feature subset selection, FAST, DBSCAN, SU, Eps, MinPts 1. INTRODUCTION Data mining is an associative subfield of computer science; In large data sets process of identifying patterns through computational process involvingmethodsattheintersection of artificial intelligence, machine learning, statistics and database system [4]. Tooabstractinformationfroma dataset and transform it intoanunderstandablestructureforfurther use is the overall goals of data mining process. Explaining the past through data exploration and predicting the future by means of data analysis (Modelling) involved in Data mining. Data mining is a multi-disciplinary field which combines statistics, machine learning, artificial intelligence and database technology. The value of data mining applications is often estimated to be very high. Over yearsof operation large amounts of data stored by many businesses, and data mining is able to extract very profitable knowledge from this data. The businesses are then able to advantages the extracted knowledge into more clients, more sales, and greater profits. In the engineering and medical fields the same is applicable. Statistics: The science of collecting, classifying, summarizing, organizing, analyzing, and interpreting data. Artificial Intelligence: Dealing with the simulation of intelligent behaviors in order to perform activities that are normally thought to require intelligence by study of computer algorithms. Machine Learning: The study of computer algorithms to learn in order to improve automatically through experience. Database: The science and technology of collecting, storing and managing data so users can retrieve, add, update or remove such data. Data Warehousing: The science and technology of collecting, storing and managing data with advanced multi- dimensional reporting services in support of the decision making processes. 1.1 Modeling: A model is created to forecast an result is the process of predictive modeling. If categorical result then it is called classification and if numerical result is then it is called regression. Assignment of observations into clusters so that observations in the same cluster are similar is the clustering or descriptive modeling. An Associationrules can find attractive associations amongst considerations. 1.2 Clustering: A cluster is a subset of data which are similar. Dividing a dataset into groups such that the members of each group are as similar (close) as possible to one another, and different groups are as dissimilar (far) as possible from one another is the process of Clustering (also called unsupervised learning). Clustering can uncover previously undetected relationships in a dataset. There are many applications for cluster analysis. Clustering can be used in business, to discover and characterize customer segments for marketing purposes and in biology cluster analysis can be used; for classification of plants and animals given their features cluster analysis can be used. Main groups of clustering algorithms are: 1. Hierarchical o Agglomerative o Divisive 2. Partitive o K Means o Self-Organizing Map
2.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 810 3. Density Based Method 4. Grid Based Method 5. Model Based Method 6. Constraint Based Method A good clustering method requirement is: (I) Capacity to discover some or all of the hidden clusters (II) Within-cluster similarity and between-cluster dissimilarity (III) Capacity to deal with various types of attributes (IV) Deal with noise and outliers (V) Can handle high dimensionality (VI) Scalable, Interpretable and usable 1.3 DBSCAN: DBSCAN (Density-Based spatial cluster of Applications with Noise) may be a density primarily based cluster rule which can generate any variety of clusters, and additionally for the distribution of spatial information [1].To convert great amount of data into separate clusters in order to better and faster access is the main purpose of cluster rule. The rule grows regions with sufficientlyhighdensityintoclustersand discovers clusters of arbitrary forminspatial databaseswith noise. It defines a cluster as a highest set of density- connected points. Set of density-connected objects that's highest with respect to density-reach ability may be a density-based cluster. As every object not contained in any cluster for considering the noise. DBSCAN method is sensitive to its parameter e and Min Pts, and leaves the user with the responsibility of selecting parameter values that will cause the discovery of acceptable clusters. The machine complexness of DBSCAN is O(nlogn) if a spatial index is employed, wherever n is the rangeofinfoobjects. Otherwise, it's O(n2). In advance DBSCAN doesn't need to know the amount of categories to be fashioned. DBSCAN can't solely notice freeform category, however additionally to spot the noise points. a collection contains the most range of knowledge objects that density property in DBSCAN rule is defined as category [1]. For all of the unmarked objects in information set D, select object P and marked P as visited. Region question for P to determine whether or not it's a core object. If P isn't a core object, then mark it as noise and re-select another object that's not marked. If P may be a core object, then establish category C for the core object P and generals the objects at intervals P as seed objects to region query to increasing { the category} C till no new object be partofclass C, cluster method over. that's once the amount of objects within the given radius (Ξ΅) region not but the density threshold (MinPts), then cluster. Thanks to taking the density distribution of knowledge object into account, therefore it will mining for freeform datasets. 2. LITERATURE SURVEY A feature selection algorithmic can be seen as the combination of a searchtechniqueforproposingnewfeature subsets, at the side of associate analysis live that scores the various feature subsets. The only algorithmic program is to check every possible set of features finding the one that minimizes the error rate. This can be associate exhaustive search of the space, and is computationallyintractablefor all but the smallest of feature sets. The selection of evaluation metric heavily influences the algorithmic program, and it's these analysis metrics that distinguish between the 3 main categories of feature selection algorithms: wrappers, filters and embedded methods. 2.1 Wrapper methods: Use a predictive model to record feature subsets. Every new set is used to track a model that is approved on a hold-out set. Calculating the amount of fault created on it hold-out set (the error rate of the model) give the score for that set [3]. As wrapper methods train a brand new model for every subset, they're very computationally comprehensive, butconsistently give the performing feature set for that specific sort of model. Figure 1: Wrapper Method 2.2 Filter methods: Use a proxy measure rather than the error rate to score a feature subset. This measure is selected to be speedy to compute, while still capturing the usefulness of the feature set. Generally measures include the mutual information, the point wise mutual information, Pearson product-moment correlation coefficient, inter/intra class distance or the scores of significance tests for each class/feature combinations. Filters are usually less computationally strengthens than wrappers, but they produce a feature set which is not tuned to a specific type of predictive model [3].
3.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 811 This lack of tuning means a feature set from a filter is more general than the set from a wrapper, usually giving small prediction performance than a wrapper. However the feature set doesn't contain the assumptions of a prediction model, and hence is more useful for exposing the relationships between the features. Many filters provide a feature ranking rather than an explicit best feature subset, and the cutoff point in the ranking is chosen via cross- validation. This method has also been used as a pre- processing step for wrapper methods, allowinga wrapper to be used on big problems. Figure 2: Filter Method 2.3 Embedded methods: A catch-all group of techniques which implement feature selection as part of the model construction process. The exemplar of this path is the LASSO method for designing a linear model, which penalizes the regression coefficients with an L1 penalty; compress many of them to zero. Any features which have non-zero regression coefficients are 'selected' by the LASSO algorithm. Improvements to the LASSO include Bolasso which bootstraps samples, and FeaLect which scores all thefeaturesbasedoncombinatorial analysis of regression coefficients. One other popular pathis the Recursive Feature Elimination algorithm, commonly used with SupportVectorMachinestorepeatedlyconstructa model and remove features with minimum weights. These approaches tend to be betweenfiltersand wrappersinterms of computational diversity. Stepwise regression is the most preferred form of feature selection in statistics, which is a wrapper technique. It is a greedy algorithm that appends the best feature (or deletes the worst feature) at each round. To determine whentostop the algorithm is the main control issue. In machine learning, this is typically done by cross-validation. In statistics, some standards are optimized. This leads to the inherent problem of nesting. Figure 3: Embedded Method 3. PROBLEM STATEMENT Feature selection is a task of crucial importance for the application of machine learning in various domains. With respect to efficiency and effectiveness many existentfeature selection ways poses a severe challenge due to increase of data dimensionality. Above all methods are impressive search algorithm that contributes itself directly to feature selection; however this direct application is slow down by the recent increase of data dimensionality.Thereforeaccommodatenewalgorithm to manage with the high dimensionality of the data becomes increasingly demanding. Given a set of d-dimensional points DB = {p1, p2, ..., pn}, a minimal density of clusters de- fined by Eps and MinPts, and a set of computer CP = {C1, C2, ..., Cn} managed by Map- Reduce platform; find the density-based clusters with respect to the given Eps and MinPts values. 4. PROPOSED SYSTEM Feature set choice is consider because the method of characteristic and removing as several irrelevant and redundant options as doable. this is often as a result of extraneous options donβt contribute to the prognosticative accuracy and redundant options donβt redound to obtaining a stronger predictor for that they supply largely data that is already gift in different feature(s). Of the numerous feature set choice algorithms, some will effectively remove extraneous options however fail to handle redundant options however a number of others will remove the extraneous whereas taking care of the redundant options [3]. The proposed FAST algorithm false under the Filter method. The filter method in addition to the generality is excellent when the numbers of features are very large. Feature selection is theprocessofanalyzingandremovingas many as relevant and redundantfeatureasmanyaspossible. Unrelated features do not donate to the predictive accuracy and excessive feature provides information whichisalready present in other feature. Figure 4: System Architecture
4.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 812 Figure 5: DBSCAN Flowchart based on Map Reduce Figure 6: Flow Diagram Decision Tree: Classification or regression builds by decision tree in the form of tree structure. It breaks down a dataset into smaller and smaller subsets while at the same time an associated decision tree is incrementally developed. Tree with decision nodes and leaf nodes is the final result. A decision node has two or more branches. classification or decisionrepresentedbyleaf node. root node is the topmost decision node in a tree which corresponds to the best predictor . both categorical and numerical data can handle by decision trees. Algorithm: The core algorithm for building decision trees called ID3 which make use of a top-down, excessive search through the space of available branches with no backtracking. ID3 uses Entropy and Information Gain to build a decision tree. Entropy: A decision tree is built top-down from a root node and involves dividing the data into subsets that contain instances with identical values (homogenous).Todetermine the homogeneity of a sample algorithm ID3 is used. Entropy is zero if the sample is completely homogeneous and the entropy is one if sample is an equally divided. Figure 7: Entropy We need to determine two types of entropy using frequency tables to build a decision tree as follows: a) Entropy using the frequency table of one attributes: c E (S) = β - Ρi log2 pi i=1 b) Entropy using the frequency table of two attributes: E (T, X) = β P(c)E(c) C β¬ X Symmetric Uncertainty: For measuring correlation between either two features or a feature and the target concept we choose symmetric uncertainty. SU (X, Y) =2 * Gain( X | Y) / H (X) + H (Y) Where, 1. H (X) = Entropy of a discrete random variable X. Suppose p(x) is the prior probabilities for all values of X, H (X) is defined by H(X)= - β p(x) log2 p(x) xΒ£X 2. Gain (X|Y) = amount by which the entropy of Y decreases. It reflects the additional information about Y provided by X and is called information gain. Gain (X|Y) = H(X) β H (X|Y) = H(Y) β H (Y|X) Where H (X|Y) is the conditional entropy which quantifies the remaining entropy of a random variable X given that the value of another random variable Y is known. Suppose p(x) is the prior probabilities for all value of X and p(x|y) is the posterior probabilities of X given the values of Y, H(X|Y) is defined by
5.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 813 H(X|Y)=-βp(y)βp(x|y)log2 p(x|y) yΒ£Y xΒ£X Information gain is a symmetrical measure. That is the amount of information gained about X after observing Y is equal to the amount of information gain about Y after observing X. This ensures that the orderoftwovariableswill not affect the value of the measure. T-Relevance: T-relevance of Fi andC denotedby SU(Fi,C)is the relevance between the feature Fi Β£ F and the target concept C We say Fi is a strong T-relevance feature when SU (Fi, C) is greater than a predetermined threshold Γ. F-Correlation: F-correlation of Fi and Fj denoted by SU(Fi,Fj) is the correlation between any pair of features Fi and Fj. (Fi,Fj Β£ Fβ§ iβ j) Hadoop: Using the MapReduce algorithm Hadoop runs the applications, where the data is processed in parallel on different CPU nodes. In short, Hadoop framework is capable enough to develop applications capable of running on clusters of computers and they could perform complete statistical analysis for huge amounts of data. A Hadoop frame-worked application works in an environment that provides distributed storage and computation across clusters of computers. Hadoop is designed to scale up from single server to thousands of machines, each offering local computation and storage. The term MapReduce actually refers to the following two different tasks that Hadoop perform: The Map Task: This is the begining task, which takes input data and converts it into a set of data, where distinctive elements are broken down into tuples (key/value pairs) The Reduce Task: This task takes the output from a map task as input and combines those data tuples into a smaller set of tuples. The reduce task is always performed after the map task. 5. FAST ALGORITHM Inputs: D(F1, F2, ..., FM, C) - the given data set π - the T-Relevance threshold, radius Eps, density threshold MinPts , Output:class C output: S - selected feature subset //==== Part 1 : Irrelevant Feature Removal ==== 1 for i = 1 to m do 2 T-Relevance = SU (Fi, C) 3 if T-Relevance > π then 4 S = S βͺ {Fi }; //==== Part 2 : Density Based Clustering ==== 5 G = NULL; //G is a complete graph 6 for each pair of features { πΉ β² π, πΉβ² π} β S do 7 F-Correlation = SU ( πΉβ² π , πΉβ² π) 8 π΄ππ πΉβ² π πππ ππ πΉβ² π π‘π πΊ π€ππ‘π F-Correlation ππ π‘ππ π€πππππ‘ ππ π‘ππ ππππππ πππππππ ππππ ; //== Part 3: Representative Feature Selection ==== 9 DBSCAN(D, Eps, MinPts) 10 Begin 11 init C=0;// The number of classes is initialized to 0 12 for each unvisited point p in D 13 mark p as visited; //marked P as accessed 14 N = getNeighbours (p, Eps); 15 if sizeOf(N) < MinPts then 16 mark p as Noise; //if sizeOf(N) < MinPts,then mark P as noise 17 else 18 C= next cluster; //create a new class C 19 ExpandCluster (p, N, C, Eps, MinPts);//expand class C 20 end if 21 end for 22 End 23 for each cluster 24 add feature with max T-relevance to final subset 25 end for 26 Hadoop : (MapReduce) Mapper: Identity Function for Value (k, v) ο (v, _) Reducer: Identity Function (kβ, _) ο (kβ, ββ) 6. SIMULATION RESULT Process of identifying and removing as manyasrelevantand redundant feature as many as possible is themainaimof our proposed system. Contribution of Irrelevant features to the predictive accuracy is zero and redundant feature provides information which is already present in other feature. Following simulation result provides better view of system.
6.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 814 Figure 8: shows menu buttons on the top bar for FAST Cluster application. Figure 9: shows menu to upload the data file in the application Figure 10: shows data uploaded in the application. Figure11: shows class feature entered by user. Figure 12: shows result of relevance and Irrerelevance calculation Figure 13: shows result of F-correlation Figure 14: shows result of final cluster of features
7.
International Research Journal
of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 04 Issue: 08 | Aug -2017 www.irjet.net p-ISSN: 2395-0072 Β© 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 815 Figure 15: shows final list of subset 7. CONCLUSIONS Dealing with large datasets DBSCAN algorithm based on MapReduce faces scalabilityproblems. Largedatasetsare cut into small set of data and it processes the small set of data parallel. Experimental results showsthatDBSCAN algorithm based on the MapReduce alleviated the problem of time delay caused by large datasets and have good timeliness. REFERENCES [1].MR-IDBSCAN: Efficient Parallel Incremental DBSCAN Algorithm using MapReduce by Maitry Noticewala CSE department Parul Institute of Technology 29, Gopaleshvar Soc. Tadwadi Rander Road, Surat-395009 and Dinesh Vaghela CSE department Parul Institute of Technology Limda, Vadodara, India [2]. Research of parallel DBSCAN clustering algorithm based on MapReduce by Xiufen Fu, Shanshan Hu and Yaguang Wang School of Computer, Guangdong University of Technology, 510006, P.R.China xffu@gdut,edu.cn, 895962584@qq.com [3]. Filter versus Wrapper Feature Subset Selection in Large Dimensionality Micro array: A Review, Binita Kumari,Tripti Swarnkar . Department of Computer Science - Department of Computer Applications, ITER, SOA University Orissa, INDIA [4].Data Mining Cluster Analysis http://www.tutorialspoint.com/data_mining/dm_cluste r_analysis.html, Copyright Β© tutorialspoint.com [5]. Wikipedia on clusters [6]. A Dynamic Feature Selection Method For Document Ranking with Relevance Feedback Approach, K.Latha, B.Bhargavi, C.Dharani and R.Rajaram Department of Computer Science and Engineering, Anna University of Technology, Tiruchirappalli, Tamil Nadu, India. E-mail: erklatha@gmail.com Department of Information Technology, Thiagarajar College of Engineering, Madurai, Tamil Nadu, India E-mail: rrajaram@tce.edu [7].Bayes Classifier forDifferentData Clustering-BasedExtra Selection Methods,Abhinav. Kunja,Ch.Heyma RajuDept. of Computer Science and Engineering, Gitam University Visakhapatnam, AP, India [8].An Evaluation on Feature Selection for Text Clustering, Tao Liu Department of Information Science, Nankai University, Tianjin 300071, P. R. China. Shengping Liu Department of Information Science, Peking University, Beijing 100871, P. R. China. Zheng Chen, Wei-Ying Ma Microsoft Research Asia, 49 Zhichun Road, Beijing 100080, P. R. China BIOGRAPHIES Nilam Prakash Sonawale is Student of M.E. Computer Engineering, Bharati Vidyapeeth College of Engineering, Mumbai University, Navi Mumbai, Maharashtra, India. Senior Consultant at Capgemini Pvt. Ltd., Her area of interest is Data Warehousing and Data Mining. Prof. B.W. Balkhande is a Professor in the Department of Computer Engineering, Bharati Vidyapeeth College of Engineering,MumbaiUniversity,NaviMumbai,Maharashtra, India. His area of interest is Data Mining, algorithms and programming.
Download now