Sciweavers

1601 search results - page 55 / 321
» Closed Sets for Labeled Data
Sort
View
NAACL
2010
13 years 8 months ago
The Effect of Ambiguity on the Automated Acquisition of WSD Examples
Several methods for automatically generating labeled examples that can be used as training data for WSD systems have been proposed, including a semisupervised approach based on re...
Mark Stevenson, Yikun Guo
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
13 years 8 months ago
Multi-label Feature Selection for Graph Classification
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
Xiangnan Kong, Philip S. Yu
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 3 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
DASFAA
2004
IEEE
135views Database» more  DASFAA 2004»
14 years 2 months ago
Semi-supervised Text Classification Using Partitioned EM
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
Gao Cong, Wee Sun Lee, Haoran Wu, Bing Liu
SDM
2009
SIAM
105views Data Mining» more  SDM 2009»
14 years 8 months ago
Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
Gerhard Paaß, Frank Reichartz