Sciweavers

258 search results - page 36 / 52
» Loops: Relevant or Redundant
Sort
View
JMLR
2010
155views more  JMLR 2010»
13 years 6 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
JAIR
2011
138views more  JAIR 2011»
13 years 2 months ago
Identifying Aspects for Web-Search Queries
Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effectiv...
Fei Wu, Jayant Madhavan, Alon Y. Halevy
BMCBI
2007
166views more  BMCBI 2007»
13 years 7 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
ICDM
2008
IEEE
186views Data Mining» more  ICDM 2008»
14 years 2 months ago
xCrawl: A High-Recall Crawling Method for Web Mining
Web Mining Systems exploit the redundancy of data published on the Web to automatically extract information from existing web documents. The first step in the Information Extract...
Kostyantyn M. Shchekotykhin, Dietmar Jannach, Gerh...
ALMOB
2007
133views more  ALMOB 2007»
13 years 7 months ago
Characteristics of predictor sets found using differential prioritization
Background: Feature selection plays an undeniably important role in classification problems involving high dimensional datasets such as microarray datasets. For filter-based featu...
Chia Huey Ooi, Madhu Chetty, Shyh Wei Teng