Relevant bibliographies by topics / Possibilistic clustering

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Possibilistic clustering'

Author: Grafiati
Published: 28 September 2022
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Possibilistic clustering.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Possibilistic clustering"

1

Miyamoto, Sadaaki, Youhei Kuroda, and Kenta Arai. "Algorithms for Sequential Extraction of Clusters by Possibilistic Method and Comparison with Mountain Clustering." Journal of Advanced Computational Intelligence and Intelligent Informatics 12, no. 5 (2008): 448–53. http://dx.doi.org/10.20965/jaciii.2008.p0448.

Full text
Abstract:
In addition to fuzzy c-means, possibilistic clustering is useful because it is robust against noise in data. The generated clusters are, however, strongly dependent on an initial value. We propose a family of algorithms for sequentially generating clusters “one cluster at a time,” which includes possibilistic medoid clustering. These algorithms automatically determine the number of clusters. Due to possibilistic clustering's similarity to the mountain clustering by Yager and Filev, we compare their formulation and performance in numerical examples.
APA, Harvard, Vancouver, ISO, and other styles
2

Ubukata, Seiki, Katsuya Koike, Akira Notsu, and Katsuhiro Honda. "MMMs-Induced Possibilistic Fuzzy Co-Clustering and its Characteristics." Journal of Advanced Computational Intelligence and Intelligent Informatics 22, no. 5 (2018): 747–58. http://dx.doi.org/10.20965/jaciii.2018.p0747.

Full text
Abstract:
In the field of cluster analysis, fuzzy theory including the concept of fuzzy sets has been actively utilized to realize flexible and robust clustering methods. FuzzyC-means (FCM), which is the most representative fuzzy clustering method, has been extended to achieve more robust clustering. For example, noise FCM (NFCM) performs noise rejection by introducing a noise cluster that absorbs noise objects and possibilisticC-means (PCM) performs the independent extraction of possibilistic clusters by introducing cluster-wise noise clusters. Similarly, in the field of co-clustering, fuzzy co-cluster
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Miin-Shen, and Kuo-Lung Wu. "Unsupervised possibilistic clustering." Pattern Recognition 39, no. 1 (2006): 5–21. http://dx.doi.org/10.1016/j.patcog.2005.07.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

ZHOU, JIAN, and CHIH-CHENG HUNG. "A GENERALIZED APPROACH TO POSSIBILISTIC CLUSTERING ALGORITHMS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 15, supp02 (2007): 117–38. http://dx.doi.org/10.1142/s0218488507004650.

Full text
Abstract:
Fuzzy clustering is an approach using the fuzzy set theory as a tool for data grouping, which has advantages over traditional clustering in many applications. Many fuzzy clustering algorithms have been developed in the literature including fuzzy c-means and possibilistic clustering algorithms, which are all objective-function based methods. Different from the existing fuzzy clustering approaches, in this paper, a general approach of fuzzy clustering is initiated from a new point of view, in which the memberships are estimated directly according to the data information using the fuzzy set theor
APA, Harvard, Vancouver, ISO, and other styles
5

Pimentel, Bruno Almeida, and Renata M. C. R. de Souza. "A Generalized Multivariate Approach for Possibilistic Fuzzy C-Means Clustering." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 26, no. 06 (2018): 893–916. http://dx.doi.org/10.1142/s021848851850040x.

Full text
Abstract:
Fuzzy c-Means (FCM) and Possibilistic c-Means (PCM) are the most popular algorithms of the fuzzy and possibilistic clustering approaches, respectively. A hybridization of these methods, called Possibilistic Fuzzy c-Means (PFCM), solves noise sensitivity defect of FCM and overcomes the coincident clusters problem of PCM. Although PFCM have shown good performance in cluster detection, it does not consider that different variables can produce different membership and possibility degrees and this can improve the clustering quality as it has been performed with the Multivariate Fuzzy c-Means (MFCM)
APA, Harvard, Vancouver, ISO, and other styles
6

De Cáceres, Miquel, Francesc Oliva, and Xavier Font. "On relational possibilistic clustering." Pattern Recognition 39, no. 11 (2006): 2010–24. http://dx.doi.org/10.1016/j.patcog.2006.04.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Treerattanapitak, Kiatichai, and Chuleerat Jaruskulchai. "Possibilistic Exponential Fuzzy Clustering." Journal of Computer Science and Technology 28, no. 2 (2013): 311–21. http://dx.doi.org/10.1007/s11390-013-1331-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Naghi, Mirtill-Boglárka, Levente Kovács, and László Szilágyi. "A generalized fuzzy-possibilistic c-means clustering algorithm." Acta Universitatis Sapientiae, Informatica 15, no. 2 (2023): 404–31. http://dx.doi.org/10.2478/ausi-2023-0023.

Full text
Abstract:
Abstract The so-called fuzzy-possibilistic c-means (FPCM) algorithm was introduced as an early mixed-partition method aiming to eliminate some adverse effects present in the behavior of the fuzzy c-means (FCM) and the possibilistic c-means (PCM) algorithms. A great advantage of FPCM was the low number of its parameters, as it eliminated the possibilistic penalty terms used by PCM. Unfortunately, FPCM in its original formulation also has a weak point: the strength of the possibilistic term is in inverse proportion with the number of clustered data items, which makes FPCM act like FCM when clust
APA, Harvard, Vancouver, ISO, and other styles
9

Chowdhary, Chiranji Lal, and D. P. Acharjya. "Clustering Algorithm in Possibilistic Exponential Fuzzy C-Mean Segmenting Medical Images." Journal of Biomimetics, Biomaterials and Biomedical Engineering 30 (January 2017): 12–23. http://dx.doi.org/10.4028/www.scientific.net/jbbbe.30.12.

Full text
Abstract:
Different fuzzy segmentation methods were used in medical imaging from last two decades for obtaining better accuracy in various approaches like detecting tumours etc. Well-known fuzzy segmentations like fuzzy c-means (FCM) assign data to every cluster but that is not realistic in few circumstances. Our paper proposes a novel possibilistic exponential fuzzy c-means (PEFCM) clustering algorithm for segmenting medical images. This new clustering algorithm technology can maintain the advantages of a possibilistic fuzzy c-means (PFCM) and exponential fuzzy c-mean (EFCM) clustering algorithms to ma
APA, Harvard, Vancouver, ISO, and other styles
10

Hamasuna, Yukihiro, and Yasunori Endo. "On Sequential Cluster Extraction Based onL1-Regularized Possibilisticc-Means." Journal of Advanced Computational Intelligence and Intelligent Informatics 19, no. 5 (2015): 655–61. http://dx.doi.org/10.20965/jaciii.2015.p0655.

Full text
Abstract:
Sequential cluster extraction algorithms are useful clustering methods that extract clusters one by one without the number of clusters having to be determined in advance. Typical examples of these algorithms are sequential hardc-means (SHCM) and possibilistic clustering (PCM) based algorithms. Two types ofL1-regularized possibilistic clustering are proposed to induce crisp and possibilistic allocation rules and to construct a novel sequential cluster extraction algorithm. The relationship between the proposed method and SHCM is also discussed. The effectiveness of the proposed method is verifi
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Possibilistic clustering"

1

Ben, marzouka Wissal. "Traitement possibiliste d'images, application au recalage d'images." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2022. http://www.theses.fr/2022IMTA0271.

Full text
Abstract:
Dans ce travail, nous proposons un système de recalage géométrique possibiliste qui fusionne les connaissances sémantiques et les connaissances au niveau du gris des images à recaler. Les méthodes de recalage géométrique existantes se reposent sur une analyse des connaissances au niveau des capteurs lors de la détection des primitives ainsi que lors de la mise en correspondance. L'évaluation des résultats de ces méthodes de recalage géométrique présente des limites au niveau de la perfection de la précision causées par le nombre important de faux amers. L’idée principale de notre approche prop
APA, Harvard, Vancouver, ISO, and other styles
2

Lai, Chien-Yo, and 賴建佑. "A Robust Possibilistic Clustering Algorithm." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/45186783961780903545.

Full text
Abstract:
博士<br>中原大學<br>應用數學研究所<br>98<br>Krishnapuram and Keller (1993) first proposed a possibilistic approach to clustering, called possibilistic c-means (PCM), by relaxing the constraint in fuzzy c-means (FCM) that the memberships of a data point across classes sum to 1. The PCM algorithm has a tendency to produce coincident clusters. This can be a merit of PCM as a good mode-seeking algorithm if initials and parameters are suitably chosen. However, the performance of PCM heavily depends on the selection of parameters and initializations. In this paper, for solving these parameters and initialization
APA, Harvard, Vancouver, ISO, and other styles
3

Cheng, Yu-Rong, and 鄭俞榮. "Metaheuristic-Based Possibilistic Fuzzy k-modes Algorithms for Categorical Data Clustering." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/fz5xw5.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>工業管理系<br>107<br>Recently, smart devices and technology applications are applied widely in many fields. An enormous amount of information is recorded and collected rapidly. Thus, the process to analyze and obtain valuable information from the data becomes a very crucial issue. Clustering analysis plays an important role to solve the aforementioned issue. However, facing with the different types of data, the appropriate approach should be chosen to handle the data. This study focuses on categorical data. A possibilistic fuzzy k-modes (PFKM) algorithm is proposed by combining th
APA, Harvard, Vancouver, ISO, and other styles
4

劉強. "Analysis of Shell Clustering Algorithms for Template-Based Shapes that Combine Fuzzy and Possibilistic Clustering Approaches." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/41996598083117357187.

Full text
Abstract:
碩士<br>國立交通大學<br>多媒體工程研究所<br>98<br>This goal of this thesis is to investigate the results of data clustering. Specifically, we want to study the effect of fuzzy c-means (FCM) and possibilistic c-means (PCM), as well as their combinations, in template-based shell clustering. Template-based shell clustering is the process of detecting clusters of particular geometrical shapes through clustering algorithms. The use of FCM and PCM in shell clustering has appeared in many research. However, both FCM and PCM have their shortcomings. For example, the results of FCM are highly affected by noise, and PC
APA, Harvard, Vancouver, ISO, and other styles
5

Chang, Sheng-Chieh, and 張勝傑. "Rough Interval Possibilistic Fuzzy C-Means Clustering Algorithms and Implemented on Smart Phone." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/e57f8z.

Full text
Abstract:
碩士<br>國立虎尾科技大學<br>光電與材料科技研究所<br>100<br>Clustering algorithms have been widely used such as pattern recognition, data mining and machine learning, etc. It is an unsupervised classification that is divided into groups according to data sets. That is, the data sets of similarity partition belong to the same group; otherwise data sets divide other groups in the clustering algorithms. In general, clustering methods are divided into partitioning-based, hierarchical, density-based, grid-based and model-based. In this thesis, we focus on the partitioning-based approach. K-means (KM) clustering algorit
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Tzu-Chieh, and 楊子頡. "Three-Dimensional Possibilistic C-Template Shell Clustering and its Application in 3D Object Segmentation." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/38716084468398410151.

Full text
Abstract:
碩士<br>國立交通大學<br>多媒體工程研究所<br>104<br>The purpose of this thesis is to use a model to match a similar object in three-dimensional space.This research includes four main parts: First, using the Kinect sensor to take the real world; second, splitting the point cloud into separate items; third, creating a model to match each individual item; lastly, getting the final result. The thesis includes descriptions on using Kinect to establish a point cloud, using 3D Hough Transform to find and remove the cloud points of planes, and using connected-component to separate individual objects. The focus of this
APA, Harvard, Vancouver, ISO, and other styles
7

Ghosh, Debashis. "A Possibilistic Approach To Handwritten Script Identification Via Morphological Methods For Pattern Representation." Thesis, 1999. https://etd.iisc.ac.in/handle/2005/1673.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ghosh, Debashis. "A Possibilistic Approach To Handwritten Script Identification Via Morphological Methods For Pattern Representation." Thesis, 1999. http://etd.iisc.ernet.in/handle/2005/1673.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Possibilistic clustering"

1

Viattchenin, Dmitri A. A Heuristic Approach to Possibilistic Clustering: Algorithms and Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35536-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Viattchenin, Dmitri A. A heuristic approach to possibilistic clustering: Algorithms and applications. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Viattchenin, Dmitri A. A. A Heuristic Approach to Possibilistic Clustering: Algorithms and Applications. Springer, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Possibilistic clustering"

1

Ferone, Alessio, and Antonio Maratea. "Graded Possibilistic Meta Clustering." In Neural Approaches to Dynamics of Signal Exchanges. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-8950-4_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Viattchenin, Dmitri A. "Heuristic Algorithms of Possibilistic Clustering." In A Heuristic Approach to Possibilistic Clustering: Algorithms and Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35536-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xenaki, Spyridoula D., Konstantinos D. Koutroumbas, and Athanasios A. Rontogiannis. "Sequential Sparse Adaptive Possibilistic Clustering." In Artificial Intelligence: Methods and Applications. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07064-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ammar, Asma, and Zied Elouedi. "A New Possibilistic Clustering Method: The Possibilistic K-Modes." In AI*IA 2011: Artificial Intelligence Around Man and Beyond. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23954-0_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Viattchenin, Dmitri A. "Applications of Heuristic Algorithms of Possibilistic Clustering." In A Heuristic Approach to Possibilistic Clustering: Algorithms and Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35536-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ammar, Asma, Zied Elouedi, and Pawan Lingras. "K-Modes Clustering Using Possibilistic Membership." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31718-7_61.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Viattchenin, Dmitri A. "Clustering Approaches for Uncertain Data." In A Heuristic Approach to Possibilistic Clustering: Algorithms and Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35536-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Szilágyi, László. "Robust Clustering Algorithms Employing Fuzzy-Possibilistic Product Partition." In Fuzzy Sets, Rough Sets, Multisets and Clustering. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-47557-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhou, Jie, Can Gao, and Jia Yin. "Rough Possibilistic Clustering for Fabric Image Segmentation." In Artificial Intelligence on Fashion and Textiles. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99695-0_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yu, Hong, and Hu Luo. "A Novel Possibilistic Fuzzy Leader Clustering Algorithm." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10646-0_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Possibilistic clustering"

1

Xenaki, Spyridoula D., Konstantinos D. Koutroumbas, and Athanasios A. Rontogiannis. "Adaptive possibilistic clustering." In 2013 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT). IEEE, 2013. http://dx.doi.org/10.1109/isspit.2013.6781918.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Antoine, Violaine, Jose A. Guerrero, Tanya Boone, and Gerardo Romero. "Possibilistic clustering with seeds." In 2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2018. http://dx.doi.org/10.1109/fuzz-ieee.2018.8491655.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xenaki, Spyridoula D., Konstantinos D. Koutroumbas, and Athanasios A. Rontogiannis. "Sparse adaptive possibilistic clustering." In ICASSP 2014 - 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2014. http://dx.doi.org/10.1109/icassp.2014.6854165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Runkler, Thomas A., and James M. Keller. "Sequential possibilistic one-means clustering." In 2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2017. http://dx.doi.org/10.1109/fuzz-ieee.2017.8015413.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Koutsibella, Aggeliki, and Konstantinos D. Koutroumbas. "Stochastic gradient descent possibilistic clustering." In SETN 2020: 11th Hellenic Conference on Artificial Intelligence. ACM, 2020. http://dx.doi.org/10.1145/3411408.3411436.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lei Wang, Hongbing Ji, and Xinbo Gao. "Fully Unsupervised Possibilistic Entropy Clustering." In 2006 IEEE International Conference on Fuzzy Systems. IEEE, 2006. http://dx.doi.org/10.1109/fuzzy.2006.1682027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jafar, O. A. Mohamed, and R. Sivakumar. "A study on possibilistic and fuzzy possibilistic C-means clustering algorithms for data clustering." In 2012 International Conference on Emerging Trends in Science, Engineering and Technology (INCOSET). IEEE, 2012. http://dx.doi.org/10.1109/incoset.2012.6513887.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kanzawa, Yuchi. "On Possibilistic Clustering Algorithms Based on Noise Clustering." In 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS). IEEE, 2016. http://dx.doi.org/10.1109/scis-isis.2016.0023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kung, Chung-Chun, Hong-Chi Ku, and Jui-Yiao Su. "Possibilistic c-regression models clustering algorithm." In 2013 IEEE International Conference on System Science and Engineering (ICSSE). IEEE, 2013. http://dx.doi.org/10.1109/icsse.2013.6614679.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bin, Chen, Li Bin, and Pan Zhisong. "Robust location estimation with possibilistic clustering." In 2009 ISECS International Colloquium on Computing, Communication, Control, and Management (CCCM). IEEE, 2009. http://dx.doi.org/10.1109/cccm.2009.5268066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Possibilistic clustering' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography