Sciweavers

252 search results - page 49 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
CASCON
2010
187views Education» more  CASCON 2010»
13 years 3 months ago
A Framework for Automatically Supporting End-Users in Service Composition
In Service Oriented Architecture (SOA), service composition integrates existing services to fulfill specific tasks using a set of standards and tools. However, current service comp...
Hua Xiao, Ying Zou, Ran Tang, Joanna Ng, Leho Nigu...
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 6 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
SAC
2010
ACM
14 years 19 days ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
14 years 6 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 8 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri