Reflections on NoteCards: seven issues for the next generation of hypermedia systems
Communications of the ACM
Do we need maps to navigate round hypertext documents?
Electronic Publishing—Origination, Dissemination, and Design
The art of navigating through hypertext
Communications of the ACM
A set-to-set linking strategy for hypertext systems
COCS '90 Proceedings of the ACM SIGOIS and IEEE CS TC-OA conference on Office information systems
Hypertext/hypermedia handbook
Identifying aggregates in hypertext structures
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Implementing hypertext database relationships through aggregations and exception
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Architectures for volatile hypertext
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
HDM—a model for the design of hypertext applications
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Matching hypertext models to hypertext systems
ECHT '92 Proceedings of the ACM conference on Hypertext
Clustering Algorithms
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
HyPursuit: a hierarchical network search engine that exploits content-link hypertext clustering
Proceedings of the the seventh ACM conference on Hypertext
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Clustering hypertext with applications to web searching
HYPERTEXT '00 Proceedings of the eleventh ACM on Hypertext and hypermedia
Information retrieval on the Web
Lectures on information retrieval
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Three-Tier Clustering: An Online Citation Clustering System
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
Information Retrieval on the Web
ESSIR '00 Proceedings of the Third European Summer-School on Lectures on Information Retrieval-Revised Lectures
Utilizing hyperlink transitivity to improve web page clustering
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Combinatorics, Probability and Computing
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
A method for personalized clustering in data intensive web applications
Proceedings of the joint international workshop on Adaptivity, personalization & the semantic web
Communities in graphs and hypergraphs
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Graph parameters measuring neighbourhoods in graphs-Bounds and applications
Discrete Applied Mathematics
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
GraphClus, a MATLAB program for cluster analysis using graph theory
Computers & Geosciences
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Web page clustering: a hyperlink-based similarity and matrix-based hierarchical algorithms
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
On cutwidth parameterized by vertex cover
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Branch and bound for the cutwidth minimization problem
Computers and Operations Research
Variable Formulation Search for the Cutwidth Minimization Problem
Applied Soft Computing
| Hi-index | 0.00 |
Identifying nodes of information that are highly related has many applications in any information systems, and in particular in hypertext systems. In this paper we present a technique to identify “natural” clusters in a hypertext. A natural cluster is a cluster that is not arbitrary, but depends only on intrinsic properties of the hypertext. In our case, the property we will use to identify the clusters is the number of independent paths between nodes. Using the graph theoretic definition of k-edge-components we present an aggregation technique to cluster the nodes. We then use this techniques to cluster three medium sized hypertexts that were developed by different authors for different users, using different methodologies. We also show how to use clustering to improve data display, browsing and retrieval.