Sciweavers

1701 search results - page 179 / 341
» Providing k-anonymity in data mining
Sort
View
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
14 years 12 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
15 years 11 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
72
Voted
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 5 months ago
A Generalization of Forward-Backward Algorithm
Structured prediction has become very important in recent years. A simple but notable class of structured prediction is one for sequences, so-called sequential labeling. For sequen...
Ai Azuma, Yuji Matsumoto
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 5 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
15 years 5 months ago
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast
We present a demo of ESTER, a search engine that combines the ease of use, speed and scalability of full-text search with the powerful semantic capabilities of ontologies. ESTER s...
Holger Bast, Fabian M. Suchanek, Ingmar Weber