Sciweavers

1169 search results - page 72 / 234
» Comparing performance of algorithms for generating concept l...
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
A comparison of retrieval-based hierarchical clustering approaches to person name disambiguation
This paper describes a simple clustering approach to person name disambiguation of retrieved documents. The methods are based on standard IR concepts and do not require any task-s...
Christof Monz, Wouter Weerkamp
IDA
2007
Springer
14 years 1 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
INFOCOM
1999
IEEE
14 years 9 hour ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
BMCBI
2007
155views more  BMCBI 2007»
13 years 7 months ago
ProMEX: a mass spectral reference database for proteins and protein phosphorylation sites
Background: In the last decade, techniques were established for the large scale genome-wide analysis of proteins, RNA, and metabolites, and database solutions have been developed ...
Jan Hummel, Michaela Niemann, Stefanie Wienkoop, W...
AAAI
1993
13 years 9 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk