Sciweavers

1601 search results - page 24 / 321
» Closed Sets for Labeled Data
Sort
View
CICLING
2010
Springer
15 years 8 months ago
A Sequential Model for Discourse Segmentation
Identifying discourse relations in a text is essential for various tasks in Natural Language Processing, such as automatic text summarization, question-answering, and dialogue gene...
Hugo Hernault, Danushka Bollegala, Mitsuru Ishizuk...
130
Voted
NIPS
2003
15 years 3 months ago
Log-Linear Models for Label Ranking
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
Ofer Dekel, Christopher D. Manning, Yoram Singer
DEXAW
2010
IEEE
204views Database» more  DEXAW 2010»
15 years 2 months ago
Scalable Recursive Top-Down Hierarchical Clustering Approach with Implicit Model Selection for Textual Data Sets
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
Markus Muhr, Vedran Sabol, Michael Granitzer
PAKDD
2004
ACM
117views Data Mining» more  PAKDD 2004»
15 years 7 months ago
Constraint-Based Mining of Formal Concepts in Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting concepts, i.e., closed sets of objects (or transactions) and associated closed sets...
Jérémy Besson, Céline Robarde...
BILDMED
2006
112views Algorithms» more  BILDMED 2006»
15 years 3 months ago
Extracting Consistent and Manifold Interfaces from Multi-valued Volume Data Sets
We propose an algorithm to construct a set of interfaces that separate the connected components of a multi-valued volume dataset. While each single interface is a manifold triangle...
Stephan Bischoff, Leif Kobbelt