Sciweavers

134 search results - page 6 / 27
» Getting complete rulebase from recorded data
Sort
View
IADIS
2004
14 years 11 months ago
A Scheme for Approximate Matching Event Announcements to a Customer Database
An event is a short and data-rich document and it refers to an instance of an announcement type such as "wedding", "birth", "graduation", "aucti...
Ray R. Hashemi, John R. Talburt
BMCBI
2005
81views more  BMCBI 2005»
14 years 9 months ago
Evolutionary sequence analysis of complete eukaryote genomes
Background: Gene duplication and gene loss during the evolution of eukaryotes have hindered attempts to estimate phylogenies and divergence times of species. Although current meth...
Jaime E. Blair, Prachi Shah, S. Blair Hedges
SAC
2005
ACM
15 years 3 months ago
Privacy preserving learning in negotiation
Machine learning techniques are widely used in negotiation systems. To get more accurate and satisfactory learning results, negotiation parties have the desire to employ learning ...
Sheng Zhang, Fillia Makedon
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
15 years 2 months ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola
JCDL
2006
ACM
161views Education» more  JCDL 2006»
15 years 3 months ago
Learning metadata from the evidence in an on-line citation matching scheme
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
Isaac G. Councill, Huajing Li, Ziming Zhuang, Sand...