557 search results - page 57 / 112 » Visualizing Weighted Edges in Graphs |
145
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
156
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
126
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
112
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
109
click to vote
WEA
2009
Springer
15 years 10 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...