Sciweavers

387 search results - page 53 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
AAAI
1993
13 years 9 months ago
Automatically Constructing a Dictionary for Information Extraction Tasks
Knowledge-based natural language processing systems have achieved good success with certain tasks but they are often criticized because they depend on a domain-specific dictionar...
Ellen Riloff
SIGSOFT
2007
ACM
14 years 8 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 6 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 5 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
WWW
2007
ACM
14 years 8 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...