Sciweavers

1060 search results - page 102 / 212
» On the Discovery of Random Trees
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 15 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
CIKM
2009
Springer
16 years 28 days ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
AICCSA
2008
IEEE
842views Hardware» more  AICCSA 2008»
15 years 8 months ago
Intelligent heart disease prediction system using data mining techniques
The healthcare industry collects huge amounts of healthcare data which, unfortunately, are not "mined" to discover hidden information for effective decision making. Disc...
Sellappan Palaniappan, Rafiah Awang
ACL
2003
15 years 7 months ago
An Improved Extraction Pattern Representation Model for Automatic IE Pattern Acquisition
Several approaches have been described for the automatic unsupervised acquisition of patterns for information extraction. Each approach is based on a particular model for the patt...
Kiyoshi Sudo, Satoshi Sekine, Ralph Grishman
CMG
2001
15 years 7 months ago
Effective Use of the KDD Process and Data Mining for Computer Performance Professionals
- The KDD (Knowledge Discovery in Databases) paradigm is a step by step process for finding interesting patterns in large amounts of data. Data mining is one step in the process. T...
Susan P. Imberman