4 research outputs found
Tetkik: Akan veri kümeleme algoritmalarını çalıştırma ve karşılaştırma
12th Turkish National Software Engineering Symposium, UYMS 2018; Istanbul; Turkey; 10 September 2018 through 12 September 2018Recently, clustering data streams have become an incredibly important research area for knowledge discovery as applications produce more and more unstoppable streaming data. In this paper we introduce clustering, streams and data streaming clustering algorithms, as well as discussions of the most important stream clustering algorithms, considering their structure. As an additional contribution of our work and differently from review and survey papers in stream clustering, we offer the practical part of the most known stream clustering algorithms, namely: (i) CluStream; (ii) DenStream; (iii) D-Stream; and (iv) ClusTree, showing their experimental results along with some performance metrics computation of for each, depending on MOA framework.Son zamanlarda, veri akışlarını kümelemek uygulamalar daha fazla
durdurulamaz veri akışı üretirken bilgi keşfi için inanılmaz derecede önemli bir
araştırma alanı haline gelmiştir.Bu makalede, kümeleme, akışlar ve veri
akışlarını kümeleme algoritmalarını en önemli akım kümeleme algoritmalarının
irdelenmesini yapılarını da göz önünde bulundurarak tanıtıyoruz. Çalışmamızın
ek bir katkısı ve akış kümeleme alanında yapılmış tetkit ve gözden geçirme
makalelerinden farklı olarak en bilinen akış kümeleme algoritmalarının Pratik
kısmını, yani: (i) CluStream; (ii) DenStream; (iii) D-Stream; and (iv) ClusTree,
MOA Java çerçevesine bağlı olarak, her biri için bazı performans metriklerinin
hesaplanmasıyla birlikte deney sonuçlarını göstererek sunuyoruz
Streaming Data Clustering in MOA using the Leader Algorithm
This master thesis presents a novel stream clustering algorithm, called StreamLeader. It presents a way to deliver clustering without the need of resorting to conventional clustering algorithms, like most other algorithms do. We test it, outperforming its state of the art rivals in most of the case
ABSTRACT Adaptive Non-linear Clustering in Data Streams
Data stream clustering has emerged as a challenging and interesting problem over the past few years. Due to the evolving nature, and one-pass restriction imposed by the data stream model, traditional clustering algorithms are inapplicable for stream clustering. This problem becomes even more challenging when the data is highdimensional and the clusters are not linearly separable in the input space. In this paper, we propose a non-linear stream clustering algorithm that adapts to the stream’s evolutionary changes. Using the kernel methods for dealing with the non-linearity of data separation, we propose a novel 2-tier stream clustering architecture. Tier-1 captures the temporal locality in the stream, by partitioning it into segments, using a kernel-based novelty detection approach. Tier-2 exploits this segment structure to continuously project the streaming data non-linearly onto a low-dimensional space (LDS), before assigning them to a cluster. We demonstrate the effectiveness of our approach through extensive experimental evaluation on various real-world datasets