Sciweavers

16404 search results - page 626 / 3281
» A set coverage problem
Sort
View
COOPIS
2004
IEEE
15 years 11 months ago
Trust-Aware Collaborative Filtering for Recommender Systems
Recommender Systems allow people to find the resources they need by making use of the experiences and opinions of their nearest neighbours. Costly annotations by experts are replac...
Paolo Massa, Paolo Avesani
ICML
2002
IEEE
16 years 8 months ago
Partially Supervised Classification of Text Documents
We investigate the following problem: Given a set of documents of a particular topic or class ?, and a large set ? of mixed documents that contains documents from class ? and othe...
Bing Liu, Wee Sun Lee, Philip S. Yu, Xiaoli Li
TNN
2010
121views Management» more  TNN 2010»
15 years 1 months ago
Foundations of implementing the competitive layer model by Lotka-Volterra recurrent neural networks
The competitive layer model (CLM) can be described by an optimization problem. The problem can be further formulated by an energy function, called the CLM energy function, in the s...
Zhang Yi
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 7 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
16 years 1 months ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf