Sciweavers

2228 search results - page 128 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
16 years 7 days ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
IRI
2008
IEEE
16 years 1 months ago
Compound record clustering algorithm for design pattern detection by decision tree learning
Recovering design patterns applied in a system can help refactoring the system. Machine learning algorithms have been successfully applied in mining data patterns. However, one of...
Jing Dong, Yongtao Sun, Yajing Zhao
PDPTA
2010
15 years 4 months ago
Distributed Mobile Computing: Development of Distributed Applications Using Mobile Agents
There exist distributed scenarios in which the need for dynamism, mobility, and adaptivity, has to be addressed with highly dynamical approaches. These scenarios present different ...
Carlos Bobed, Sergio Ilarri, Eduardo Mena
194
Voted
ICML
2007
IEEE
16 years 7 months ago
Maximum margin clustering made practical
Maximum margin clustering (MMC) is a recent large margin unsupervised learning approach that has often outperformed conventional clustering methods. Computationally, it involves n...
Kai Zhang, Ivor W. Tsang, James T. Kwok