128 search results - page 14 / 26 » On Mining Closed Sets in Multi-Relational Data |
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
IJKDB
2010
14 years 7 months ago
2010
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We introduce a novel framew...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...