An Efficient Fuzzy Possibilistic C-Means with Penalized and Compensated Constraints

α
Dr. D.Vanisri
Dr. D.Vanisri
σ
C.Loganathan
C.Loganathan
α Anna University, Chennai Anna University, Chennai

Send Message

To: Author

An Efficient Fuzzy Possibilistic C-Means with Penalized and Compensated Constraints

Article Fingerprint

ReserarchID

02DJC

An Efficient Fuzzy Possibilistic C-Means with Penalized and Compensated Constraints Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Improvement in sensing and storage devices and impressive growth in applications such as Internet search, digital imaging, and video surveillance have generated many high-volume, high-dimensional data. The raise in both the quantity and the kind of data requires improvement in techniques to understand, process and summarize the data. Categorizing data into reasonable groupings is one of the most essential techniques for understanding and learning. This is performed with the help of technique called clustering. This clustering technique is widely helpful in fields such as pattern recognition, image processing, and data analysis. The commonly used clustering technique is K-Means clustering. But this clustering results in misclassification when large data are involved in clustering. To overcome this disadvantage, Fuzzy-Possibilistic C-Means (FPCM) algorithm can be used for clustering. FPCM combines the advantages of Possibilistic C-Means (PCM) algorithm and fuzzy logic. For further improving the performance of clustering, penalized and compensated constraints are used in this paper. Penalized and compensated terms are embedded with the modified fuzzy possibilistic clustering method’s objective function to construct the clustering with enhanced performance. The experimental result illustrates the enhanced performance of the proposed clustering technique when compared to the fuzzy possibilistic c-means clustering algorithm.

References

20 Cites in Article
  1. N Pal,K Pal,J Keller,J Bezdek (2005). A possibilistic fuzzy c-means clustering algorithm.
  2. Vuda,Dr Sreenivasarao,Vidyavathi (2006). Comparative Analysis of Fuzzy C-Mean and Modified Fuzzy Possibilistic C -Mean ©2011.
  3. Yang Yan,Lihui Chen (2009). Hyperspherical possibilistic fuzzy c-means for high-dimensional data clustering.
  4. Long Yu,; Jian,Xiao,Gao Zheng (2009). Robust Interval Type-2 Possibilistic C-means Clustering and its Application for Fuzzy Modeling.
  5. Chunhui Zhang,Yiming Zhou,Trevor Martin (2008). Similarity Based Fuzzy and Possibilistic c-means Algorithm.
  6. James Bezdek (1981). Modified Objective Function Algorithms.
  7. J Bezdek (1981). Pattern Recognition with Fuzzy Objective Function Algorithms.
  8. M Barni,V Cappellini,A Mecocci (1996). Comments on "A possibilistic approach to clustering".
  9. M Berthold,D Hand (1999). Intelligent Data Analysis.
  10. M Berry (2003). A review of: “VARIOWIN”, software for Spatial Data Analysis in 2D, 1996, Yvan Pannatier, Springer-Verlag New York, Inc., 175 Fifth Avenue, New York, NY 10010, USA..
  11. N Pal,K Pal,J Bezdek (1997). A mixed c-means clustering model.
  12. K Lung (2005). A cluster validity index for fuzzy clustering.
  13. U Fayyad,G Piatetsky-Shapiro,P Smyth,R Uthurusamy (1996). Advances in Knowledge Discovery and Data Mining.
  14. M Yang (1993). On a class of fuzzy classi4cation maximum likelihood procedures.
  15. Miin-Shen Yang,Chen-Feng Su (1994). On parameter estimation for normal mixtures based on fuzzy clustering algorithms.
  16. J Lin (1999). Fuzzy clustering using a compensated fuzzy hopfield network.
  17. Wen-Liang Hung,Miin-Shen Yang,De-Hua Chen (2005). Parameter selection for suppressed fuzzy c-means with an application to MRI segmentation.
  18. Everardo Bárcenas,Jesús Lavalle (2011). Global Numerical Constraints on Trees.
  19. Xiao-Hong Wu,Jian-Jiang Zhou (2005). Possibilistic Fuzzy c-Means Clustering Model Using Kernel Methods.
  20. B Ojeda-Magafia,R Ruelas,M Corona-Nakamura,D Andina (2010). An Improvement to the Possibilistic Fuzzy c-Means Clustering Algorithm.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. D.Vanisri. 1970. \u201cAn Efficient Fuzzy Possibilistic C-Means with Penalized and Compensated Constraints\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 3): .

Download Citation

Journal Specifications
Keywords
Version of record

v1.2

Issue date

March 12, 2011

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20891
Total Downloads: 11101
2026 Trends
Related Research

Published Article

Improvement in sensing and storage devices and impressive growth in applications such as Internet search, digital imaging, and video surveillance have generated many high-volume, high-dimensional data. The raise in both the quantity and the kind of data requires improvement in techniques to understand, process and summarize the data. Categorizing data into reasonable groupings is one of the most essential techniques for understanding and learning. This is performed with the help of technique called clustering. This clustering technique is widely helpful in fields such as pattern recognition, image processing, and data analysis. The commonly used clustering technique is K-Means clustering. But this clustering results in misclassification when large data are involved in clustering. To overcome this disadvantage, Fuzzy-Possibilistic C-Means (FPCM) algorithm can be used for clustering. FPCM combines the advantages of Possibilistic C-Means (PCM) algorithm and fuzzy logic. For further improving the performance of clustering, penalized and compensated constraints are used in this paper. Penalized and compensated terms are embedded with the modified fuzzy possibilistic clustering method’s objective function to construct the clustering with enhanced performance. The experimental result illustrates the enhanced performance of the proposed clustering technique when compared to the fuzzy possibilistic c-means clustering algorithm.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Efficient Fuzzy Possibilistic C-Means with Penalized and Compensated Constraints

Dr. D.Vanisri
Dr. D.Vanisri Anna University, Chennai
C.Loganathan
C.Loganathan

Research Journals