Sciweavers

5107 search results - page 576 / 1022
» Data Mining and Information Retrieval
Sort
View
SIGSOFT
2007
ACM
16 years 7 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...
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
16 years 20 days ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
INCDM
2010
Springer
146views Data Mining» more  INCDM 2010»
15 years 11 months ago
Learning from Humanoid Cartoon Designs
Abstract. Character design is a key ingredient to the success of any comicbook, graphic novel, or animated feature. Artists typically use shape, size and proportion as the first de...
Md. Tanvirul Islam, Kaiser Md. Nahiduzzaman, Why Y...
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
15 years 8 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
15 years 5 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...