256 search results - page 26 / 52 » A Fully Distributed Framework for Cost-Sensitive Data Mining |
JPDC
2007
13 years 7 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
PAKDD
2010
ACM
13 years 6 months ago
2010
ACM
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
Abstract. We propose a new approach to modeling time-varying relational data such as e-mail transactions based on a dynamic extension of matrix factorization. To estimate effectiv...
JNCA
2000
13 years 7 months ago
2000
This paper envisions a distributed network storage service with Quality-ofService (QoS) guarantees, and describes its architecture and key mechanisms. When fully realized, this se...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...