145 search results - page 26 / 29 » Mining closed relational graphs with connectivity constraint... |
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
101
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
123
click to vote
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
116
click to vote
PODC
2004
ACM
15 years 5 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
111
click to vote
WWW
2005
ACM
16 years 10 days ago
2005
ACM
A staggering number of multimedia applications are being introduced every day. Yet, the inordinate delays encountered in retrieving multimedia documents make it difficult to use t...