Sciweavers

7988 search results - page 1165 / 1598
» A Useful Undecidable Theory
Sort
View
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
16 years 7 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 7 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 7 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 7 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 7 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
« Prev « First page 1165 / 1598 Last » Next »