Call for Paper - July 2019 Edition
IJCA solicits original research papers for the July 2019 Edition. Last date of manuscript submission is June 20, 2019. Read More

Constraint based Clustering in Feature Subset Selection Algorithm

Print
PDF
IJCA Proceedings on National Conference cum Workshop on Bioinformatics and Computational Biology
© 2014 by IJCA Journal
NCWBCB - Number 1
Year of Publication: 2014
Authors:
S. Aswini
A. Kumaresan
K. Vijayakumar
D. Murali

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

@article{key:article,
	author = {S. Aswini and A. Kumaresan and K. Vijayakumar and D. Murali},
	title = {Article: Constraint based Clustering in Feature Subset Selection Algorithm},
	journal = {IJCA Proceedings on National Conference cum Workshop on Bioinformatics and Computational Biology},
	year = {2014},
	volume = {NCWBCB},
	number = {1},
	pages = {1-6},
	month = {May},
	note = {Full text available}
}

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

  • http://forum. jntuworld. com/ Data-Warehousing-and-Data- Mining
  • 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.
  • Toward Integrating Feature SelectionAlgorithms for Classification and Clustering Huan Liu, Senior Member, IEEE, and Lei Yu, Student Member, IEEE
  • Jaromczyk J. W. and Toussaint G. T. , Relative Neighborhood Graphs and Their Relatives, In Proceedings of the IEEE, 80, pp 1502-1517, 1992
  • Construction of Decision Tree : Attribute Selection Measures R. Aruna devi¹, Dr. K. Nirmala
  • http://www. icsd. aegean. gr
  • . Algorithm for computation of Relative Neighborhood Graph Electronics Letters 3rd july 1980 vol. 16,no. 14
  • Good Approximation for the Relative Neighborhood Graph Diogo Vieirer Andrade , Luiz Henrique de Figueiredo
  • Constraint Based Clustering in Large Database Anthony K. H. Tong, jiaweihan ,Laks V. S. Lakshmanan]
  • A Fast Clustering-Based Feature Subset Selection Algorithm for High Dimensional Data Qinbao Song, Jingjie Ni and Guangtao Wan