Abstract
Along with the fast advance of internet technique, internet users have to deal with tremendous data every day. One of the most useful knowledge exploited from web is about the transfer of the information expressed by two data sets collected in different time phases. With this kind of knowledge, we can further apprehend what information newly appears, what information is antiquated, and what information maintains unchanged along with time passing. The task aiming at acquiring this kind of knowledge is formally entitled as data evolvement analysis. Clustering is a good solution to this task. By comparing the clustering results respectively formed in different time phases, it is easy to acquire the transfer of the information. Unfortunately, aforementioned plan is time- consuming, since it needs to perform clustering algorithm once again, once input data are updated. Therefore, we need to design a dynamic clustering algorithm. Once input data are updated, it can form clustering results by adjusting the existent cluster partition instead of performing clustering algorithm again. For this reason, a novel Topology Self-Adaptive Clustering algorithm (abbreviated as TSAC) is proposed in this paper. This algorithm comes from Self Organizing Mapping algorithm (abbreviated as SOM), whereas, it doesn't need to make any assumption about neuron topology beforehand. Besides, when input data are updated, its topology remodels meanwhile. For further enhancing its performance, it imports minimum spanning tree to preserve its topology order, which is never performed by any traditional SOM based algorithms. For clearly measuring the magnitude of the transfer of the information, it partitions data space into several grids, and calculates the density of each grid to quantify the transfer. Experiment results demonstrate that TSAC can automatically tune its topology. By this algorithm and in addition to grid structure, the transfer of the information can be legibly visualized.
| Original language | English |
|---|---|
| Pages (from-to) | 162-172 |
| Number of pages | 11 |
| Journal | Information Technology and Control |
| Volume | 41 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2012 |
| Externally published | Yes |
Keywords
- Competitive learning
- Data evolvement analysis
- Minimum spanning tree
- Selforganizing-mapping
- Topology adaptation
Fingerprint
Dive into the research topics of 'Data evolvement analysis based on topology self-adaptive clustering algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver