Sciweavers

256 search results - page 18 / 52
» A Fully Distributed Framework for Cost-Sensitive Data Mining
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
MOBICOM
2003
ACM
14 years 27 days ago
ARC: an integrated admission and rate control framework for CDMA data networks based on non-cooperative games
The competition among wireless data service providers brings in an option for the customers to switch their providers, due to unsatisfactory service or otherwise. However, the exi...
Haitao Lin, Mainak Chatterjee, Sajal K. Das, Kalya...
KDD
2008
ACM
182views Data Mining» more  KDD 2008»
14 years 8 months ago
Classification with partial labels
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
Nam Nguyen, Rich Caruana
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 4 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic