2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS) 2018
DOI: 10.1109/iciibms.2018.8550020
|View full text |Cite
|
Sign up to set email alerts
|

OCA: Overlapping Clustering Application: Unsupervised Approach for Data Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Clustering algorithms collect primary information based on the attributes, characteristics, and diversity of that information to perform the clustering process by computing the least distance between the centroid of each cluster and the current elements to put into any cluster [20]. The determination of optimal number of clusters which is decided by the user is key weaknesses of K-means algorithm.…”
Section: K-means Clustering Algorithmmentioning
confidence: 99%
“…Clustering algorithms collect primary information based on the attributes, characteristics, and diversity of that information to perform the clustering process by computing the least distance between the centroid of each cluster and the current elements to put into any cluster [20]. The determination of optimal number of clusters which is decided by the user is key weaknesses of K-means algorithm.…”
Section: K-means Clustering Algorithmmentioning
confidence: 99%
“…In [8] and [31] the authors provide methods that would efficiently mine outliers in large datasets. Other recent studies have devised methods in clustering analysis that will prune or screen out outliers from the dataset such as Liu, et al [29], Barai and Dey [6], Gan and Nk [21] , Danganan et al [19] and Chagas et al [14] . For example, Yu, et al [35] proposed an outlier detection method to identify and eliminate outliers in the dataset forming an outlier-eliminated dataset (OED).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Similarly, Danganan et al [19] proposed a modification of MCOKE [3] by incorporating a median absolute deviation (MAD) that measures any potential outliers in the dataset. The authors proposed a threephased approach in which the objects are ranked in ascending order and the distance of each object is calculated against MAD which is multiplied to a certain constant number determined by the user to obtain a decision value.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…K-means is one of the most popular and oldest clustering techniques and can be applied even to large data sets [19]. The K-means algorithm gives a simple method to execute an approximate solution.…”
Section: K-means Algorithmmentioning
confidence: 99%