Sciweavers

7150 search results - page 859 / 1430
» Graph-Based Data Mining
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 9 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
KDD
2010
ACM
287views Data Mining» more  KDD 2010»
15 years 9 months ago
Designing efficient cascaded classifiers: tradeoff between accuracy and cost
We propose a method to train a cascade of classifiers by simultaneously optimizing all its stages. The approach relies on the idea of optimizing soft cascades. In particular, inst...
Vikas C. Raykar, Balaji Krishnapuram, Shipeng Yu
LREC
2010
150views Education» more  LREC 2010»
15 years 8 months ago
Detection of Peculiar Examples using LOF and One Class SVM
This paper proposes the method to detect peculiar examples of the target word from a corpus. The peculiar example is regarded as an outlier in the given example set. Therefore we ...
Hiroyuki Shinnou, Minoru Sasaki
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 8 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
SDM
2007
SIAM
149views Data Mining» more  SDM 2007»
15 years 8 months ago
WAT: Finding Top-K Discords in Time Series Database
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
Yingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, ...