Top > JACIII > On Objective-Based Rough c-Regression

single-jc.php

JACIII Vol.19 No.1 pp. 36-42
doi: 10.20965/jaciii.2015.p0036
(2015)

Paper:

Views over last 60 days: 743

On Objective-Based Rough c-Regression

Akira Sugawara*, Yasunori Endo**, and Naohiko Kinoshita*

*Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan

**Faculty of Engineering, Information and Systems, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan

Received:
April 20, 2014
Accepted:
August 25, 2014
Published:
January 20, 2015
Creative Commons License
Keywords:
clustering, rough set, optimization, c-regression
Abstract
The pattern recognition method of clustering is a technique automatically classifying data into clusters. Among clustering methods, c-regression based on fuzzy set theory, called Fuzzy c-Regression (FCR), is proposed to get a linear dataset structure. The most recent clustering is based on rough set theory called rough clustering, which is less descriptive than fuzzy clustering. A typical rough clustering algorithm is Rough k-Regression (RKR). However, RKR has problems because it depends on initial values and has no optimum index, so we do not know whether a clustering result will be optimal. This paper proposes Rough c-Regression (RCR) based on the optimization of an objective function and demonstrates its effectiveness through numerical examples.
Cite this article as:
A. Sugawara, Y. Endo, and N. Kinoshita, “On Objective-Based Rough c-Regression,” J. Adv. Comput. Intell. Intell. Inform., Vol.19 No.1, pp. 36-42, 2015.
Data files:
References
  1. [1] S. Miyamoto, “Introduction to Cluster analysis,” morikita-shuppan, 1999.
  2. [2] S. Hirano and S. Tsumoto, “Rough Clustering and Its Application to Time-series Medical Data Analysis,” The 19th Annual Conf. of the Japanese Society Symp., pp. 260-265, 2007.
  3. [3] G. Peters, “Some refinements of rough k-means clustering,” Pattern Recognition, Vol.39, pp. 1481-1491, 2006.
  4. [4] Y. Endo and N. Kinoshita, “Objective-Based Rough c-Means Clustering,” Int. J. of Intelligent Systems, Vol.28, Issue 9, pp. 907-925, 2013.
  5. [5] R. J. Hathaway and J. C. Bezdek, “Switching regression models and fuzzy clustering,” IEEE Trans. on Fuzzy Systems, Vol.1, No.3, pp. 195-204, 1993.
  6. [6] G. Peters, “Rough Clustering and Regression Analysis,” RSKT2007, LNAI 4481, pp. 292-299, 2007.
  7. [7] Z. Pawlak, “Rough sets,” Int. J. pf Computer and Information Sciences, Vol.11, No.5, pp. 341-356, 1982.
  8. [8] M. Inuiguchi, “Analysis of Information Table by Rough Set Theory,” Institute of Systems, Control and Information Engineers, Vol.49, No.5, pp. 165-172, 2005.
  9. [9] Y. Nalayama and S.Miyamoto, “Least Square Deviations and Least Absolute Deviations in c-Regression Models,” J. of of the Fuzzy System Symp., Vol.17, pp. 583-586, 2001.
  10. [10] S. Miyamoto, K. Umayahara, T. Nemoto, and O. Takata, “Algorithm of Fuzzy c-Regression Based on Least Absolute Deviations,” J. of Japan Society for Fuzzy Theory and Intelligent Informatics, Vol.12, No.4, pp. 578-587, 2000.
  11. [11] P. Lingras and G. Peters, “Rough clustering,” WIREs Data Mining and Knowledge Discovery, Vol.1, Issue.1, pp. 64-72, 2011.

Creative Commons License  This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 22, 2024