145 search results - page 14 / 29 » Mining closed relational graphs with connectivity constraint... |
104
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
115
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
103
click to vote
KDD
2005
ACM
16 years 2 days ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
102
click to vote
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
Discovering co-expressed genes and coherent expression patterns in gene expression data is an important data analysis task in bioinformatics research and biomedical applications. ...
ALGORITHMICA
2010
14 years 11 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...