Sciweavers

325 search results - page 15 / 65
» Alternatives to two classic data structures
Sort
View
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
14 years 7 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
14 years 8 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
ICWE
2003
Springer
15 years 2 months ago
Genre and Domain Processing in an Information Retrieval Perspective
Abstract. The massive amount of textual data on the Web raises numerous classification problems. Although the notion of domain is widely acknowledged in the IR field, the applica...
Céline Poudat, Guillaume Cleuziou
ECAI
2006
Springer
15 years 1 months ago
Preference Representation with 3-Points Intervals
In this article we are interested in the representation of qualitative preferences with the help of 3-points intervals (a vector of three increasingly ordered points). Preferences ...
Meltem Öztürk, Alexis Tsoukiàs
CSDA
2008
121views more  CSDA 2008»
14 years 9 months ago
ANOVA extensions for mixed discrete and continuous data
This paper is concerned withANOVA-like tests in the context of mixed discrete and continuous data. The likelihood ratio approach is used to obtain a location test in the mixed dat...
A. R. de Leon, Y. Zhu