Sciweavers

455 search results - page 67 / 91
» On Trees and Noncrossing Partitions
Sort
View
DKE
2008
98views more  DKE 2008»
13 years 7 months ago
Privacy-preserving imputation of missing data
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
Geetha Jagannathan, Rebecca N. Wright
IJDMMM
2008
72views more  IJDMMM 2008»
13 years 7 months ago
Mining event histories: a social science perspective
We explore how recent data-mining-based tools developed in domains such as biomedicine or text-mining for extracting interesting knowledge from sequence data could be applied to pe...
Gilbert Ritschard, Alexis Gabadinho, Nicolas S. M&...
CSDA
2007
142views more  CSDA 2007»
13 years 7 months ago
DIVCLUS-T: A monothetic divisive hierarchical clustering method
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It i...
Marie Chavent, Yves Lechevallier, Olivier Briant
PAMI
2008
195views more  PAMI 2008»
13 years 7 months ago
Path Similarity Skeleton Graph Matching
This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geo...
Xiang Bai, Longin Jan Latecki
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 7 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...