Sciweavers

4972 search results - page 106 / 995
» Ranking on graph data
Sort
View
GD
2004
Springer
15 years 9 months ago
GraphML Transformation
The efforts put into XML-related technologies have exciting consequences for XML-based graph data formats such as GraphML. We here give a systematic overview of the possibilities ...
Ulrik Brandes, Christian Pich
HT
2009
ACM
15 years 11 months ago
The scalable hyperlink store
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
Marc Najork
ICML
2005
IEEE
16 years 5 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
DATAMINE
2010
133views more  DATAMINE 2010»
15 years 4 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 8 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...