128 search results - page 16 / 26 » On Mining Closed Sets in Multi-Relational Data |
GFKL
2005
Springer
15 years 3 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...
103
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
90
Voted
NIPS
2008
14 years 11 months ago
2008
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
PAKDD
2010
ACM
15 years 2 months ago
2010
ACM
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...