Sciweavers

1760 search results - page 69 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 9 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
BMCBI
2008
175views more  BMCBI 2008»
13 years 9 months ago
Synonym set extraction from the biomedical literature by lexical pattern discovery
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
John McCrae, Nigel Collier
CN
2006
61views more  CN 2006»
13 years 9 months ago
Structuring topologically aware overlay networks using domain names
Abstract-- Overlay networks are application layer systems which facilitate users in performing distributed functions such as searches over the contents of other users. An important...
Demetrios Zeinalipour-Yazti, Vana Kalogeraki
ICDT
2001
ACM
86views Database» more  ICDT 2001»
14 years 1 months ago
Minimizing View Sets without Losing Query-Answering Power
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, w...
Chen Li, Mayank Bawa, Jeffrey D. Ullman
SOCO
2008
Springer
13 years 9 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima