Sciweavers

5221 search results - page 279 / 1045
» An On-line Problem Database
Sort
View
CINQ
2004
Springer
182views Database» more  CINQ 2004»
15 years 10 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
CINQ
2004
Springer
133views Database» more  CINQ 2004»
15 years 10 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
FIMI
2004
239views Data Mining» more  FIMI 2004»
15 years 8 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
CVPR
2011
IEEE
15 years 2 months ago
A Deformation and Lighting Insensitive Metric for Face Recognition
Face recognition is a challenging problem, complicated by variations in pose, expression, lighting, and the passage of time. Significant work has been done to solve each of these...
Anne Jorstad, David Jacobs, Alain Trouvé
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 9 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu