110 search results - page 1 / 22 » A new clustering approach based on graph partitioning for na... |
ICPR
2008
IEEE
13 years 11 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...
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
ADC
2008
Springer
13 years 11 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...