Sciweavers

6388 search results - page 206 / 1278
» High Performance Data Mining
Sort
View
PKDD
2009
Springer
137views Data Mining» more  PKDD 2009»
15 years 11 months ago
On Subgroup Discovery in Numerical Domains
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
Henrik Grosskreutz, Stefan Rüping
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
174
Voted
INFOVIS
2003
IEEE
15 years 10 months ago
Exploring High-D Spaces with Multiform Matrices and Small Multiples
We introduce an approach to visual analysis of multivariate data that integrates several methods from information visualization, exploratory data analysis (EDA), and geovisualizat...
Alan M. MacEachren, Xiping Dai, Frank Hardisty, Di...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 10 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
JMLR
2008
117views more  JMLR 2008»
15 years 4 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac