CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
Reseach Article

Constraint based Clustering in Feature Subset Selection Algorithm

Published on May 2014 by S. Aswini, A. Kumaresan, K. Vijayakumar, D. Murali
National Conference cum Workshop on Bioinformatics and Computational Biology
Foundation of Computer Science USA
NCWBCB - Number 1
May 2014
Authors: S. Aswini, A. Kumaresan, K. Vijayakumar, D. Murali
b2f9fd11-2fbd-4946-be36-ada4d4cc9ba0

S. Aswini, A. Kumaresan, K. Vijayakumar, D. Murali . Constraint based Clustering in Feature Subset Selection Algorithm. National Conference cum Workshop on Bioinformatics and Computational Biology. NCWBCB, 1 (May 2014), 1-6.

@article{
author = { S. Aswini, A. Kumaresan, K. Vijayakumar, D. Murali },
title = { Constraint based Clustering in Feature Subset Selection Algorithm },
journal = { National Conference cum Workshop on Bioinformatics and Computational Biology },
issue_date = { May 2014 },
volume = { NCWBCB },
number = { 1 },
month = { May },
year = { 2014 },
issn = 0975-8887,
pages = { 1-6 },
numpages = 6,
url = { /proceedings/ncwbcb/number1/16503-1401/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference cum Workshop on Bioinformatics and Computational Biology
%A S. Aswini
%A A. Kumaresan
%A K. Vijayakumar
%A D. Murali
%T Constraint based Clustering in Feature Subset Selection Algorithm
%J National Conference cum Workshop on Bioinformatics and Computational Biology
%@ 0975-8887
%V NCWBCB
%N 1
%P 1-6
%D 2014
%I International Journal of Computer Applications
Abstract

Constraint based clustering that satisfies set of user-defined constraint. Constraint-based clustering is an example of a mining task where flexibility is desirable. It is a generalization of standard clustering in which the user can impose constraints on the clustering to be found, such as similar and dissimilar constraints. Feature selection involves recognizing a subset of the most constructive features that produces companionable outcomes as the innovative intact set of traits. Feature selection, as a data for preliminary considered. Features are processing step is effectual in reducing the spatial property, confiscate irrelevant data, mounting learning accuracy. We proposed an algorithm for the Region of Influence (ROI). The algorithm is numb to the order in which the pairs are divided into cluster by using relative neighborhood graphs (RNGs).

References
  1. http://forum. jntuworld. com/ Data-Warehousing-and-Data- Mining
  2. Yu L. and Liu H. , Feature selection for high-dimensional data: a fast correlation-based filter solution, in Proceedings of 20th International Conference on Machine Leaning, 20(2), pp 856-863, 2003.
  3. Toward Integrating Feature SelectionAlgorithms for Classification and Clustering Huan Liu, Senior Member, IEEE, and Lei Yu, Student Member, IEEE
  4. Jaromczyk J. W. and Toussaint G. T. , Relative Neighborhood Graphs and Their Relatives, In Proceedings of the IEEE, 80, pp 1502-1517, 1992
  5. Construction of Decision Tree : Attribute Selection Measures R. Aruna devi¹, Dr. K. Nirmala
  6. http://www. icsd. aegean. gr
  7. . Algorithm for computation of Relative Neighborhood Graph Electronics Letters 3rd july 1980 vol. 16,no. 14
  8. Good Approximation for the Relative Neighborhood Graph Diogo Vieirer Andrade , Luiz Henrique de Figueiredo
  9. Constraint Based Clustering in Large Database Anthony K. H. Tong, jiaweihan ,Laks V. S. Lakshmanan]
  10. A Fast Clustering-Based Feature Subset Selection Algorithm for High Dimensional Data Qinbao Song, Jingjie Ni and Guangtao Wan
Index Terms

Computer Science
Information Sciences

Keywords

Relative Neighborhood Graphs Region Of Influence Feature Subset Selection.