Sciweavers

137 search results - page 21 / 28
» A Generic and Extendible Multi-Agent Data Mining Framework
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 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
IDEAL
2005
Springer
14 years 1 months ago
Patterns in Complex Systems Modeling
The design, development, and use of complex systems models raises a unique class of challenges and potential pitfalls, many of which are commonly recurring problems. Over time, res...
Janet Wiles, James Watson
PAMI
2011
13 years 2 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
OTM
2005
Springer
14 years 29 days ago
Life Science Grid Middleware in a More Dynamic Environment
This paper proposes a model for integrating a higher level Semantic Grid Middleware with Web Service Resource Framework (WSRF) that extends the prototype presented in [1] informed ...
Milena Radenkovic, Bartosz Wietrzyk
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 4 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...