Sciweavers

245 search results - page 30 / 49
» Finding common structured patterns in linear graphs
Sort
View
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 6 months ago
An Empirical Study of Real-World SPARQL Queries
Understanding how users tailor their SPARQL queries is crucial when designing query evaluation engines or fine-tuning RDF stores with performance in mind. In this paper we analyz...
Mario Arias, Javier D. Fernández, Miguel A....
JMLR
2010
157views more  JMLR 2010»
14 years 9 months ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 11 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
TKDE
2008
121views more  TKDE 2008»
14 years 11 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
FLAIRS
2010
15 years 1 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...