Sciweavers

587 search results - page 31 / 118
» Clustering Improves the Exploration of Graph Mining Results
Sort
View
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 6 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
TVCG
2008
145views more  TVCG 2008»
14 years 11 months ago
Geometry-Based Edge Clustering for Graph Visualization
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, ...
ICWS
2009
IEEE
15 years 9 months ago
Adaptive Prefetching Scheme Using Web Log Mining in Cluster-Based Web Systems
The main memory management has been a critical issue to provide high performance in web cluster systems. To overcome the speed gap between processors and disks, many prefetch sche...
Heung Ki Lee, Baik Song An, Eun Jung Kim
COMAD
2009
15 years 26 days ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 5 days ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims