Sciweavers

5962 search results - page 273 / 1193
» Efficient Clustering for Orders
Sort
View
DMIN
2007
85views Data Mining» more  DMIN 2007»
15 years 8 months ago
A Clustering Approach for Achieving Data Privacy
Abstract — New privacy regulations together with everincreasing data availability and computational power have created a huge interest in data privacy research. One major researc...
Alina Campan, Traian Marius Truta, John Miller, Ra...
PDCN
2004
15 years 8 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
ICIP
2009
IEEE
15 years 4 months ago
A hierarchical graph-based markovian clustering approach for the unsupervised segmentation of textured color images
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
Rachid Hedjam, Max Mignotte
SIGMOD
1998
ACM
93views Database» more  SIGMOD 1998»
15 years 11 months ago
Efficiently Mining Long Patterns from Databases
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Roberto J. Bayardo Jr.
EDBT
2009
ACM
132views Database» more  EDBT 2009»
16 years 1 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou