Sciweavers

110 search results - page 11 / 22
» Correlation exploitation in error ranking
Sort
View
ECCV
2006
Springer
13 years 11 months ago
An Efficient Method for Tensor Voting Using Steerable Filters
In many image analysis applications there is a need to extract curves in noisy images. To achieve a more robust extraction, one can exploit correlations of oriented features over a...
Erik Franken, Markus van Almsick, Peter Rongen, Lu...
ACL
2008
13 years 9 months ago
Integrating Graph-Based and Transition-Based Dependency Parsers
Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning an...
Joakim Nivre, Ryan T. McDonald
IBPRIA
2007
Springer
13 years 11 months ago
Random Forest for Gene Expression Based Cancer Classification: Overlooked Issues
Random forest is a collection (ensemble) of decision trees. It is a popular ensemble technique in pattern recognition. In this article, we apply random forest for cancer classifica...
Oleg Okun, Helen Priisalu
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
14 years 7 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan