BIRCH: an efficient data clustering method for very large databases
T Zhang, R Ramakrishnan, M Livny - ACM sigmod record, 1996 - dl.acm.org
Finding useful patterns in large datasets has attracted considerable interest recently, and
one of the most widely studied problems in this area is the identification of clusters, or …
one of the most widely studied problems in this area is the identification of clusters, or …
[图书][B] Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
SS Lightstone, TJ Teorey, T Nadeau - 2010 - books.google.com
The rapidly increasing volume of information contained in relational databases places a
strain on databases, performance, and maintainability: DBAs are under greater pressure …
strain on databases, performance, and maintainability: DBAs are under greater pressure …
Experiments in parallel clustering with DBSCAN
D Arlia, M Coppola - Euro-Par 2001 Parallel Processing: 7th International …, 2001 - Springer
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm
for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a …
for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a …
Combining partitional and hierarchical algorithms for robust and efficient data clustering with cohesion self-merging
CR Lin, MS Chen - IEEE Transactions on Knowledge and Data …, 2005 - ieeexplore.ieee.org
Data clustering has attracted a lot of research attention in the field of computational statistics
and data mining. In most related studies, the dissimilarity between two clusters is defined as …
and data mining. In most related studies, the dissimilarity between two clusters is defined as …
[PDF][PDF] Veri madenciliğinde K-means algoritması ve tıp alanında uygulanması
ŞE Dinçer - 2006 - dspace.kocaeli.edu.tr
Veri madenciliği, veri yığınlarından anlamlı bilgiler elde etme işlemidir. Çeşitli yöntem ve
teknikler aracılığı ile veri kaynakları analiz edilerek taşıdıkları bilgi keşfedilmeye çalışılır …
teknikler aracılığı ile veri kaynakları analiz edilerek taşıdıkları bilgi keşfedilmeye çalışılır …
Pixnostics: Towards measuring the value of visualization
J Schneidewind, M Sips… - 2006 IEEE Symposium On …, 2006 - ieeexplore.ieee.org
During the last two decades a wide variety of advanced methods for the visual exploration of
large data sets have been proposed. For most of these techniques user interaction has …
large data sets have been proposed. For most of these techniques user interaction has …
Using self-similarity to cluster large data sets
Clustering is a widely used knowledge discovery technique. It helps uncovering structures in
data that were not previously known. The clustering of large data sets has received a lot of …
data that were not previously known. The clustering of large data sets has received a lot of …
[PDF][PDF] 基于密度的DBSCAN 聚类算法的研究及应用
冯少荣, 肖文俊 - 2007 - core.ac.uk
首先对DBSCAN (Density Based Spatial Clustering of Applications with Noise)
聚类算法进行了深入研究, 分析了它的特点, 存在的问题及改进思想, 提出了基于DBSCAN …
聚类算法进行了深入研究, 分析了它的特点, 存在的问题及改进思想, 提出了基于DBSCAN …
Business process impact visualization and anomaly detection
MC Hao, DA Keim, U Dayal… - Information …, 2006 - journals.sagepub.com
Business operations involve many factors and relationships and are modeled as complex
business process workflows. The execution of these business processes generates vast …
business process workflows. The execution of these business processes generates vast …
An efficient clustering algorithm for market basket data based on small large ratios
In this paper we devise an efficient algorithm for clustering market-basket data items. In view
of the nature of clustering market basket data, we devise in this paper a novel measurement …
of the nature of clustering market basket data, we devise in this paper a novel measurement …