Smita Chormunge
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Smita Chormunge has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Sudarson Jena
Sambalpur University Institute of Information Technology, Sambalpur University, Burla, Odisha, India
5 shared publications Sudarson Jena
3 shared publicationsRachana Mehta
Institute of Technology, Nirma University
1 shared publication- Rachana Mehta
Computer Science and Engineering Department, School of Technology, Pandit Deendayal Energy University, Gandhinagar, India
1 shared publication
Latest Publications
- 13 February 2021
- Published by Springer Nature
- p. 199-210
Comparison Analysis of Extracting Frequent Itemsets Algorithms Using MapReduce
- 13 February 2021
- Published by Springer Nature
- p. 199-210
Comparison Analysis of Extracting Frequent Itemsets Algorithms Using MapReduce
- Open Access
- 30 April 2019
- Published by ISROSET: International Scientific Research Organization for Science, Engineering and Technology in International Journal of Computer Sciences and Engineering
- Vol. 7 (4) , 658-661
Clustering Methods Analysis on Low and High Dimensional Data
International Journal of Computer Sciences and Engineering (A UGC Approved and indexed with DOI, ICI and Approved, DPI Digital Library) is one of the leading and growing open access, peer-reviewed, monthly, and scientific research journal for scientists, engineers, research scholars, and academicians, which gains a foothold in Asia and opens to the world, aims to publish original, theoretical and practical advances in Computer Science,Information Technology, Engineering (Software, Mechanical, Civil, Electronics & Electrical), and all interdisciplinary streams of Computing Sciences. It intends to disseminate original, scientific, theoretical or applied research in the field of Computer Sciences and allied fields. It provides a platform for publishing results and research with a strong empirical component. It aims to bridge the significant gap between research and practice by promoting the publication of original, novel, industry-relevant research.
- 30 April 2019
- Published by ISROSET: International Scientific Research Organization for Science, Engineering and Technology in International Journal of Computer Sciences and Engineering
- Vol. 7 (4) , 658-661
Open AccessClustering Methods Analysis on Low and High Dimensional Data
International Journal of Computer Sciences and Engineering (A UGC Approved and indexed with DOI, ICI and Approved, DPI Digital Library) is one of the leading and growing open access, peer-reviewed, monthly, and scientific research journal for scientists, engineers, research scholars, and academicians, which gains a foothold in Asia and opens to the world, aims to publish original, theoretical and practical advances in Computer Science,Information Technology, Engineering (Software, Mechanical, Civil, Electronics & Electrical), and all interdisciplinary streams of Computing Sciences. It intends to disseminate original, scientific, theoretical or applied research in the field of Computer Sciences and allied fields. It provides a platform for publishing results and research with a strong empirical component. It aims to bridge the significant gap between research and practice by promoting the publication of original, novel, industry-relevant research.
- Open Access
- 1 December 2018
- Published by Springer Nature in Journal of Electrical Systems and Information Technology
- Vol. 5 (3) , 542-549
Correlation based feature selection with clustering for high dimensional data
- 1 December 2018
- Published by Springer Nature in Journal of Electrical Systems and Information Technology
- Vol. 5 (3) , 542-549
Open AccessCorrelation based feature selection with clustering for high dimensional data
- 1 January 2017
- Published by Totem Publisher, Inc.
- Vol. 13 (4) , 383
Clustering-Based Feature Selection Framework for Microarray Data
Gene’s expression data contains hundreds to thousands of features. It is challenging for machine learning algorithms to find the relevant information from such huge and correlated data. Irrelevant and redundant features are computationally costly and decrease the accuracy of machine learning algorithms. Feature selection plays important role to solve the problem of dimensionality. But most of the traditional feature selection algorithms fail to scale on high dimensionality problems. In this paper Clustering based Feature Selection Framework named as (CFSF) is proposed. CFSF produces optimal feature subset by eliminating irrelevant features using clustering algorithm and redundant features by applying filter measure on each cluster. Extensive experiments are carried out to compare proposed framework and other representative methods with respect to two classifiers namely Naive Bayes and Instance Based on microarray datasets. The empirical study demonstrates that the proposed framework is very efficient and effective for producing optimal feature subset and improves classifier performance.
- 1 January 2017
- Published by Totem Publisher, Inc.
- Vol. 13 (4) , 383
Clustering-Based Feature Selection Framework for Microarray Data
Gene’s expression data contains hundreds to thousands of features. It is challenging for machine learning algorithms to find the relevant information from such huge and correlated data. Irrelevant and redundant features are computationally costly and decrease the accuracy of machine learning algorithms. Feature selection plays important role to solve the problem of dimensionality. But most of the traditional feature selection algorithms fail to scale on high dimensionality problems. In this paper Clustering based Feature Selection Framework named as (CFSF) is proposed. CFSF produces optimal feature subset by eliminating irrelevant features using clustering algorithm and redundant features by applying filter measure on each cluster. Extensive experiments are carried out to compare proposed framework and other representative methods with respect to two classifiers namely Naive Bayes and Instance Based on microarray datasets. The empirical study demonstrates that the proposed framework is very efficient and effective for producing optimal feature subset and improves classifier performance.
- Open Access
- 1 August 2016
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 6 (4) , 1880-1888
Efficient Feature Subset Selection Algorithm for High Dimensional Data
Feature selection approach solves the dimensionality problem by removing irrelevant and redundant features. Existing Feature selection algorithms take more time to obtain feature subset for high dimensional data. This paper proposes a feature selection algorithm based on Information gain measures for high dimensional data termed as IFSA (Information gain based Feature Selection Algorithm) to produce optimal feature subset in efficient time and improve the computational performance of learning algorithms. IFSA algorithm works in two folds: First apply filter on dataset. Second produce the small feature subset by using information gain measure. Extensive experiments are carried out to compare proposed algorithm and other methods with respect to two different classifiers (Naive bayes and IBK) on microarray and text data sets. The results demonstrate that IFSA not only produces the most select feature subset in efficient time but also improves the classifier performance.
- 1 August 2016
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 6 (4) , 1880-1888
Open AccessEfficient Feature Subset Selection Algorithm for High Dimensional Data
Feature selection approach solves the dimensionality problem by removing irrelevant and redundant features. Existing Feature selection algorithms take more time to obtain feature subset for high dimensional data. This paper proposes a feature selection algorithm based on Information gain measures for high dimensional data termed as IFSA (Information gain based Feature Selection Algorithm) to produce optimal feature subset in efficient time and improve the computational performance of learning algorithms. IFSA algorithm works in two folds: First apply filter on dataset. Second produce the small feature subset by using information gain measure. Extensive experiments are carried out to compare proposed algorithm and other methods with respect to two different classifiers (Naive bayes and IBK) on microarray and text data sets. The results demonstrate that IFSA not only produces the most select feature subset in efficient time but also improves the classifier performance.
- 17 September 2015
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 125 (11) , 35-40
Efficiency and Effectiveness of Clustering Algorithms for High Dimensional Data
- 17 September 2015
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 125 (11) , 35-40
Efficiency and Effectiveness of Clustering Algorithms for High Dimensional Data
- 3 September 2015
- Published by Springer Nature
- p. 557-567
Performance Efficiency and Effectiveness of Clustering Methods for Microarray Datasets
- 3 September 2015
- Published by Springer Nature
- p. 557-567
Performance Efficiency and Effectiveness of Clustering Methods for Microarray Datasets
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1060-1064
Metric Based Performance Analysis of Clustering Algorithms for High Dimensional Data
Cluster analysis is a main task of exploratory data mining and plays important role in many applications. There are numerous of clustering techniques in data mining works efficiently for low dimensional data and fails to handle high dimensional data. In this paper we evaluated the performance efficiency of K-means and Agglomerative hierarchical clustering methods based on Euclidean and Manhattan distance functions for high dimensional data by varying cluster values. Efficiency concerns the computational time required to build up datasets. Based on experimental work we examined that in both case of distance functions Agglomerative clustering method is efficient in time than K-means clustering algorithm on dataset, which we use for empirical study.
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1060-1064
Metric Based Performance Analysis of Clustering Algorithms for High Dimensional Data
Cluster analysis is a main task of exploratory data mining and plays important role in many applications. There are numerous of clustering techniques in data mining works efficiently for low dimensional data and fails to handle high dimensional data. In this paper we evaluated the performance efficiency of K-means and Agglomerative hierarchical clustering methods based on Euclidean and Manhattan distance functions for high dimensional data by varying cluster values. Efficiency concerns the computational time required to build up datasets. Based on experimental work we examined that in both case of distance functions Agglomerative clustering method is efficient in time than K-means clustering algorithm on dataset, which we use for empirical study.
- Open Access
- 27 October 2014
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Evaluation of Clustering Algorithms for High Dimensional Data Based on Distance Functions
- 27 October 2014
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessEvaluation of Clustering Algorithms for High Dimensional Data Based on Distance Functions