Sciweavers

1976 search results - page 85 / 396
» Predictive Graph Mining
Sort
View
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 9 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 9 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
EPIA
2009
Springer
14 years 3 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 9 months ago
On Futuristic Query Processing in Data Streams
Recent advances in hardware technology have resulted in the ability to collect and process large amounts of data. In many cases, the collection of the data is a continuous process ...
Charu C. Aggarwal
ICDM
2009
IEEE
138views Data Mining» more  ICDM 2009»
13 years 6 months ago
Semantic-Rich Markov Models for Web Prefetching
Abstract--Domain knowledge for web applications is currently being made available as domain ontology with the advent of the semantic web, in which semantics govern relationships am...
Nizar R. Mabroukeh, Christie I. Ezeife