2000
DOI: 10.1016/s0165-0114(98)00175-4
|View full text |Cite
|
Sign up to set email alerts
|

Feature-based fuzzy classification for interpretation of mammograms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
27
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(27 citation statements)
references
References 4 publications
0
27
0
Order By: Relevance
“…2 Data distribution of the Iris flower data set and data distribution of the data set created by Eqs. (7) and (8) …”
Section: Proposal Of Granular Fuzzy C-means Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…2 Data distribution of the Iris flower data set and data distribution of the data set created by Eqs. (7) and (8) …”
Section: Proposal Of Granular Fuzzy C-means Algorithmsmentioning
confidence: 99%
“…Fuzzy Clustering algorithms [2,5,[10][11][12]14] are popular and widely used in different areas of research like pattern recognition [2], data mining [6], classification [8], image segmentation [16,18], data analysis and modeling [3] among others, obtaining good results in these implementations. The popularity of this kind of algorithms is due to the fact that allow a datum to belong to different data clusters into a given data set, the main objective of the fuzzy clustering algorithms are find interesting patterns or group of data that share similar characteristics into a given data set.…”
Section: Introductionmentioning
confidence: 99%
“…Subsequently, extensions of the FCM to different cluster shapes [60]- [62] and criteria [63] plus faster algorithms [64] were developed. A good survey of the main characteristics of the different fuzzy clustering algorithms is given in [61] and [65].…”
Section: F Location Theory and Weber Problemsmentioning
confidence: 99%
“…An image can be categorized in different feature spaces, & the FCM algorithm categorizes the image by grouping similar data points in the feature space into clusters. This clustering is accomplished by iteratively minimizing a cost function that is reliant on the distance of the pixels to the cluster centers in the feature domain (Chuang et al, 2006;Bezdek et al, 1993;Iyer et al, 2000). An image"s pixels are very much correlated, i.e.…”
Section: Introductionmentioning
confidence: 99%