๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Rough set based incremental clustering of interval data

โœ Scribed by S. Asharaf; M. Narasimha Murty; S.K. Shevade


Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
118 KB
Volume
27
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Data classification based on tolerant ro
โœ Daijin Kim ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

This paper proposes a new data classi"cation method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are de"ned to be tolerant when their similarity measure e

Nonhierarchical document clustering base
โœ Tu Bao Ho; Ngoc Binh Nguyen ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 118 KB

Document clustering, the grouping of documents into several clusters, has been recognized as a means for improving efficiency and effectiveness of information retrieval and text mining. With the growing importance of electronic media for storing and exchanging large textual databases, document clust

Model-based clustering of longitudinal d
โœ Paul D. McNicholas; T. Brendan Murphy ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ French โš– 182 KB
Data mining using extensions of the roug
โœ Lingras, P. J. ;Yao, Y. Y. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 92 KB ๐Ÿ‘ 3 views

This article examines basic issues of data mining using bases. Other authors (Kryszkiewicz

Efficient clustering of large data sets
โœ V.S. Ananthanarayana; M.Narasimha Murty; D.K. Subramanian ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB