878 search results - page 42 / 176 » Modeling Relational Data as Graphs for Mining |
156
click to vote
GFKL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
170
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
136
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
138
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
Recent proposals to apply data mining systems to problems in law enforcement, national security, and fraud detection have attracted both media attention and technical critiques of...
153
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: New systems biology studies require researchers to understand how interplay among myriads of biomolecular entities is orchestrated in order to achieve high-level cellu...