Sciweavers

4972 search results - page 179 / 995
» Ranking on graph data
Sort
View
WIOPT
2010
IEEE
15 years 5 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
ER
2008
Springer
140views Database» more  ER 2008»
15 years 8 months ago
Design Metrics for Data Warehouse Evolution
During data warehouse design, the designer frequently encounters the problem of choosing among different alternatives for the same design construct. The behavior of the chosen desi...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
WWW
2004
ACM
16 years 7 months ago
The webgraph framework I: compression techniques
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
Paolo Boldi, Sebastiano Vigna
SSD
1997
Springer
140views Database» more  SSD 1997»
15 years 10 months ago
Spatial Data Mining: A Database Approach
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
CIKM
2008
Springer
15 years 8 months ago
Error-driven generalist+experts (edge): a multi-stage ensemble framework for text categorization
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...
Jian Huang 0002, Omid Madani, C. Lee Giles