A Literature Study on Traditional Clustering Algorithms for Uncertain Data

Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 21, Issue 5

Abstract

Numerous traditional Clustering algorithms for uncertain data have been proposed in the literature such as k-medoid, global kernel k-means, k-mode, u-rule, uk-means algorithm, Uncertainty-Lineage database, Fuzzy c-means algorithm. In 2003, the traditional partitioning clustering algorithm was also modified by Chau, M et al. to perform the uncertain data clustering. They presented the UK-means algorithm as a case study and illustrate how the proposed algorithm was applied. With the increasing complexity of real-world data brought by advanced sensor devices, they believed that uncertain data mining was an important and significant research area. The purpose of this paper is to present a literature study as foundation work for doing further research on traditional clustering algorithms for uncertain data, as part of PhD work of first author.

Authors and Affiliations

S. Sathappan, D. C. Tomar

Keywords

Related Articles

A Novel Method for Compact Listing of All Particular Solutions of a System of Boolean Equations

Any system of ‘big’ Boolean equations can be reduced to a single Boolean equation {g(Z)=1}. We propose a novel method for producing a general parametric solution for such a Boolean equation without attempting to minimize...

On Generalized Douglas - Kropina Spaces

Sakaguchi proved that the class of Weyl metrics belong to the class of generalized Douglas{Weyl metric. Then, Matsumoto studied Weyl{Kropina metric. Recently, Yoshikawa and Okubo obtained the conditions for a Kropina spa...

Extensions of Locally Compact Abelian, Torsion-Free Groups by Compact Torsion Abelian Groups

Let X be a compact torsion abelian group. In this paper, we show that an extension of Fp by X splits where Fp is the p-adic number group and p a prime number. Also, we show that an extension of a torsion-free, non-divisi...

On Convexity of Right-Closed Integral Sets

Let N denote the set of non-negative integers. A set of non-negative, n-dimensional integral vectors, M⊂ Nn, is said to be right-closed, if ((x ∈M) ∧ (y ≥ x) ∧ (y ∈ Nn)) ⇒ (y ∈M). In this paper, we present a polynomial t...

Design and Comparison of Equiripple Bandpass Filter for Wireless Applications at Varying Bandwidths

This paper presents the design of equiripple programmable bandpass filter for wireless applications. The designed filter covers a wide range of bandwidth compared to what can be achieved by a simple microcontroller. This...

Download PDF file
  • EP ID EP322015
  • DOI 10.9734/BJMCS/2017/32697
  • Views 110
  • Downloads 0

How To Cite

S. Sathappan, D. C. Tomar (2017). A Literature Study on Traditional Clustering Algorithms for Uncertain Data. Journal of Advances in Mathematics and Computer Science, 21(5), 1-21. https://www.europub.co.uk/articles/-A-322015