This Title All WIREs
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 7.250

Dynamic clustering with soft computing

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Abstract Clustering methods are one of the most popular approaches to data mining. They have been successfully used in virtually any field covering domains such as economics, marketing, bioinformatics, engineering, and many others. The classic cluster algorithms require static data structures. However, there is an increasing need to address changing data patterns. On the one hand, this need is generated by the rapidly growing amount of data that is collected by modern information systems and that has led to an increasing interest in data mining as its whole again. On the other hand, modern economies and markets do not deal with stable settings any longer but are facing the challenge to adapt to constantly changing environments. These include seasonal changes but also long‐term trends that structurally change whole economies, wipe out companies that cannot adapt to these trends, and create opportunities for entrepreneurs who establish large multinational corporations virtually out of nothing in just one decade or two. Hence, it is essential for almost any organization to address these changes. Obviously, players that have information on changes first possibly obtain a strategic advantage over their competitors. This has motivated an increasing number of researchers to enrich and extend classic static clustering algorithms by dynamic derivatives. In the past decades, very promising approaches have been suggested; some selected ones will be introduced in this review. © 2012 Wiley Periodicals, Inc. This article is categorized under: Algorithmic Development > Spatial and Temporal Data Mining Algorithmic Development > Structure Discovery Technologies > Computational Intelligence Technologies > Structure Discovery and Clustering

Clustering process.

[ Normal View | Magnified View ]

Dynamic clustering cycle.

[ Normal View | Magnified View ]

(a) Membership function ‘close to 0’. (b) Resulting membership.

[ Normal View | Magnified View ]

Related Articles

Rough clustering
Soft clustering for information retrieval applications
Fuzzy set theory (WIREs WIREs Computational Statistics )

Browse by Topic

Technologies > Computational Intelligence
Algorithmic Development > Spatial and Temporal Data Mining
Technologies > Structure Discovery and Clustering
Algorithmic Development > Structure Discovery

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts