Sciweavers

249 search results - page 48 / 50
» Mining problem-solving strategies from HCI data
Sort
View
CIKM
2007
Springer
14 years 1 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
KDD
2009
ACM
232views Data Mining» more  KDD 2009»
14 years 10 hour ago
Probabilistic latent semantic user segmentation for behavioral targeted advertising
Behavioral Targeting (BT), which aims to deliver the most appropriate advertisements to the most appropriate users, is attracting much attention in online advertising market. A ke...
Xiaohui Wu, Jun Yan, Ning Liu, Shuicheng Yan, Ying...
BMCBI
2010
155views more  BMCBI 2010»
13 years 7 months ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
PROMISE
2010
13 years 2 months ago
Case-based reasoning vs parametric models for software quality optimization
Background: There are many data mining methods but few comparisons between them. For example, there are at least two ways to build quality optimizers, programs that find project o...
Adam Brady, Tim Menzies