Sciweavers

780 search results - page 109 / 156
» Reasoning about sets using redescription mining
Sort
View
CONCUR
2012
Springer
12 years 1 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 8 months ago
On the Comparison of Relative Clustering Validity Criteria.
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
Lucas Vendramin, Ricardo J. G. B. Campello, Eduard...
SIGMOD
2010
ACM
201views Database» more  SIGMOD 2010»
13 years 11 months ago
I4E: interactive investigation of iterative information extraction
Information extraction systems are increasingly being used to mine structured information from unstructured text documents. A commonly used unsupervised technique is to build iter...
Anish Das Sarma, Alpa Jain, Divesh Srivastava
SLP
1994
89views more  SLP 1994»
14 years 10 days ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 11 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal