145 search results - page 15 / 29 » Mining closed relational graphs with connectivity constraint... |
109
click to vote
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
112
click to vote
KDID
2004
15 years 1 months ago
2004
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
JAIR
2010
14 years 10 months ago
2010
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
87
Voted
SAC
2010
ACM
15 years 6 months ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
149
click to vote
WSDM
2012
ACM
13 years 7 months ago
2012
ACM
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...