Shahin Akbarpour

Work place: Department of Computer Engineering Shabestar Branch, Islamic Azad University, Shabestar, Iran

E-mail: akbarpour@iaushab.ac.ir

Website:

Research Interests: Data Mining, Computer Vision

Biography

Shahin Akbarpour was born in Iran in 1972. He received the B.S. degree in Computer science from the University of Isfahan, Iran, in 1996; the M.Sc. degree in Mathematics applied in O.R. from the Islamic Azad University, Iran, in 1999, and the Ph.D. degree in Intelligent Computing from the University Putra Malaysia, Malaysia, in 2011. He joined Islamic Azad University, Shabestar, Iran, in 1999. His main areas of research interest are computer vision, data mining, and web mining. Dr. Akbarpour is an academic member of Departments of Computer and is currently Assistant Professor.

Author Articles
A New Credibilistic Clustering Method with Mahalanobis Distance

By Ahad Rafati Shahin Akbarpour

DOI: https://doi.org/10.5815/ijmsc.2018.04.01, Pub. Date: 8 Nov. 2018

The fuzzy c-means (FCM) is the best known clustering and use the degree of membership fuzzy to data clustering. But the membership is not always for all data correctly. That is, at scattered dataset belonging is less and noisy dataset belonging is more assigned and local optimization problem occurs. Possibility c-means (PCM) was introduced to correspond weaknesses FCM approach. In PCM was not self-duality property. In other words, a sample membership for all clusters be assigned more than one and basic condition FCM were violated. One of the new method is Credibilistic clustering and based on credibility theory proposed that is used to study the behavior of fuzzy phenomenon. The aim is to provide new Credibilistic clustering approach with replacing credibility measure instead of the fuzzy membership and Mahalanobis distance use in FCM objective function. Credibility measure has self-duality property and solves coincident clustering problem. Mahalanobis distance used instead of Euclidian distance to separate cluster centers from each other and dens samples of each cluster. The result of proposed method is evaluated with three numeric dataset and Iris dataset. The most important challenge will be how to choose the initial cluster centers in the noisy dataset. In the future, we can be used FCM combined with particle swarm optimization.

[...] Read more.
Other Articles