Sciweavers

1915 search results - page 250 / 383
» Computing LTS Regression for Large Data Sets
Sort
View
SAC
2006
ACM
15 years 10 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
ICML
2007
IEEE
16 years 5 months ago
Piecewise pseudolikelihood for efficient training of conditional random fields
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood...
Charles A. Sutton, Andrew McCallum
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 11 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
15 years 6 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei
CIKM
2005
Springer
15 years 10 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...