Sciweavers

216 search results - page 23 / 44
» A hybrid exact algorithm for complete set partitioning
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 11 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
14 years 1 months ago
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
Domenico Cantone, Alfredo Ferro, Rosalba Giugno, G...
GIS
2006
ACM
14 years 8 months ago
Optimal BSPs and rectilinear cartograms
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
Mark de Berg, Elena Mumford, Bettina Speckmann
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 7 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee