Thu, 07 Aug 2008 21:31:35 BST CiteULike: Group: GraphVis - library [96 articles] http://www.citeulike.org/group/290 CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/group/290/article/384456 <i>(2002)</i><br /><br />Today, there is a huge amount of data gathered about the Earth, not only from new spatial information systems, but also from new and more sophisticated data collection technologies. This scenario leads to a number of interesting research challenges, such as how to integrate geographic information of different kinds. The basic motivation of this paper is to introduce a GIS architecture that can enable geographic information integration in a seamless and flexible way based on its semantic value... Using ontologies for integrated geographic information systems F Fonseca M Egenhofer P Agouris G Camara (2002) 2005-11-09T08:42:02-00:00 2002 ontology http://www.citeulike.org/group/290/article/384450 <i>Hum. Factors, Vol. 30, No. 2. (April 1988), pp. 127-142.</i> Using color dimensions to display data dimensions Colin Ware John Beatty Hum. Factors, Vol. 30, No. 2. (April 1988), pp. 127-142. 2005-11-09T08:01:03-00:00 1988 Hum. Factors 0018-7208 30 2 127 142 Human Factors & Ergonomics Society, Inc. color http://www.citeulike.org/group/290/article/384385 <i>Information Visualization, Vol. 3, No. 2. (June 2004), pp. 65-79.</i> Design choices when architecting visualizations Diane Tang Chris Stolte Robert Bosch doi:10.1057/palgrave.ivs.9500067 Information Visualization, Vol. 3, No. 2. (June 2004), pp. 65-79. 2005-11-09T00:43:12-00:00 2004 Information Visualization 1473-8716 3 2 65 79 Palgrave Macmillan design http://www.citeulike.org/group/290/article/384380 <i>Int. J. Hum.-Comput. Stud., Vol. 46, No. 2-3. (1997), pp. 293-310.</i> Understanding, building and using ontologies Nicola Guarino doi:10.1006/ijhc.1996.0091 Int. J. Hum.-Comput. Stud., Vol. 46, No. 2-3. (1997), pp. 293-310. 2005-11-09T00:39:53-00:00 1997 Int. J. Hum.-Comput. Stud. 1071-5819 46 2-3 293 310 Academic Press, Inc. ontology http://www.citeulike.org/group/290/article/101929 <i>Lecture Notes in Computer Science, Vol. 1547 (1998), pp. 111-124.</i><br /><br />We describe a new approach for cluster-based drawing of large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type decomposition, called the balanced aspect ratio (BAR) tree, which guarantees that the cells produced are convex and have bounded aspect ratios. In addition, the tree depth is O(log n), and its construction takes O(n log n) time, where n is the number of points. We show that the BAR tree can be used to recursively... Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs Christian Duncan Michael Goodrich Stephen Kobourov Lecture Notes in Computer Science, Vol. 1547 (1998), pp. 111-124. 2005-02-23T16:11:37-00:00 1998 Lecture Notes in Computer Science 1547 111 124 hierarchy largegraph http://www.citeulike.org/group/290/article/354084 <i>(2004)</i><br /><br />We describe a data structure for e#ciently maintaining views of dynamic graphs. Maintaining hierarchical graph views for dynamic graphs M Raitner (2004) 2005-10-18T16:37:28-00:00 2004 hierarchy http://www.citeulike.org/group/290/article/354083 <i>(2000), pp. 566-575.</i> Maintaining hierarchical graph views Adam Buchsbaum Jefferey Westbrook (2000), pp. 566-575. 2005-10-18T16:36:58-00:00 2000 566 575 Society for Industrial and Applied Mathematics hierarchy http://www.citeulike.org/group/290/article/351278 <i>Computer, Vol. 32, No. 8. (1999), pp. 68-75.</i><br /><br />Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. Existing clustering algorithms, such as K-means, PAM, CLARANS, DBSCAN, CURE, and ROCK are designed to find clusters that fit some static models. These algorithms can breakdown if the choice of parameters in the static model is incorrect with respect to the data set being clustered, or if the model is not adequate to capture... Chameleon: Hierarchical Clustering Using Dynamic Modeling George Karypis Eui Vipin News Computer, Vol. 32, No. 8. (1999), pp. 68-75. 2005-10-15T00:14:19-00:00 1999 Computer 32 8 68 75 clustering hierarchy http://www.citeulike.org/group/290/article/351153 <i>(2004), pp. 431-441.</i> Visualizing Large Graphs with Compound-Fisheye Views and Treemaps. James Abello Stephen Kobourov Roman Yusufov (2004), pp. 431-441. 2005-10-14T18:38:17-00:00 2004 431 441 largegraph http://www.citeulike.org/group/290/article/350064 <i>(2003)</i> Focus-Based Clustering for Multi-Scale Visualization François Boutin Mountaz Hascoët (2003) 2005-10-13T22:15:17-00:00 2003 IEEE Computer Society clustering http://www.citeulike.org/group/290/article/348614 <i>IEEE Comput. Graph. Appl., Vol. 25, No. 4. (July 2005), pp. 12-16.</i> Top 10 Unsolved Information Visualization Problems Chaomei Chen doi:10.1109/MCG.2005.91 IEEE Comput. Graph. Appl., Vol. 25, No. 4. (July 2005), pp. 12-16. 2005-10-12T05:58:18-00:00 2005 IEEE Comput. Graph. Appl. 0272-1716 25 4 12 16 IEEE Computer Society Press infovis http://www.citeulike.org/group/290/article/348613 <i>(2003), pp. 151-ff.</i> Visualizing software for telecommunication services Emden Gansner John Mocenigo Stephen North doi:10.1145/774833.774855 (2003), pp. 151-ff. 2005-10-12T05:50:29-00:00 2003 151 ff ACM Press application network http://www.citeulike.org/group/290/article/348612 <i>(2004), pp. 239-250.</i> Graph Drawing by Stress Majorization. Emden Gansner Yehuda Koren Stephen North (2004), pp. 239-250. 2005-10-12T05:48:05-00:00 2004 239 250 layout http://www.citeulike.org/group/290/article/348611 <i>(2005), pp. 528-535.</i> A Framework for Visualising Large Graphs Wanchun Li Seok-Hee Hong Peter Eades doi:10.1109/IV.2005.7 (2005), pp. 528-535. 2005-10-12T05:45:17-00:00 2005 528 535 IEEE Computer Society largegraph http://www.citeulike.org/group/290/article/348507 <i>(2004), pp. 175-182.</i> Topological Fisheye Views for Visualizing Large Graphs Emden Gansner Yehuda Koren Stephen North doi:10.1109/INFOVIS.2004.66 (2004), pp. 175-182. 2005-10-12T00:01:06-00:00 2004 175 182 IEEE Computer Society zoom http://www.citeulike.org/group/290/article/348488 <i>(1999)</i> Data Organization and Access for Efficient Data Mining (1999) 2005-10-11T23:33:02-00:00 1999 IEEE Computer Society data_access http://www.citeulike.org/group/290/article/77265 <i>Commun. ACM, Vol. 47, No. 12. (December 2004), pp. 35-39.</i> Structure and evolution of blogspace Ravi Kumar Jasmine Novak Prabhakar Raghavan Andrew Tomkins doi:10.1145/1035134.1035162 Commun. ACM, Vol. 47, No. 12. (December 2004), pp. 35-39. 2005-01-13T11:15:42-00:00 2004 Commun. ACM 0001-0782 47 12 35 39 ACM Press application social_network http://www.citeulike.org/group/290/article/342894 <i>No. 1027. (February0--FebruaryFebruary~ 1995), pp. 127-139.</i><br /><br />. It is a difficult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections (foci) of the graph revealing details of subgraphs. If this expansion is maintained within the context of the entire graph, information is provided about how subgraphs are embedded in the overall structure. Often it is also desirable to realign these foci in order to facilitate the visual comparison of subgraphs. We have introduced a... Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons Sheelagh David Cowperthwaite David Fracchia Thomas Shermer No. 1027. (February0--FebruaryFebruary~ 1995), pp. 127-139. 2005-10-06T21:06:04-00:00 1995 1027 127 139 Springer-Verlag graph_compare http://www.citeulike.org/group/290/article/341632 <i>(2003), pp. 77-ff.</i> A system for graph-based visualization of the evolution of software Christian Collberg Stephen Kobourov Jasvir Nagra Jacob Pitts Kevin Wampler doi:10.1145/774833.774844 (2003), pp. 77-ff. 2005-10-05T23:52:38-00:00 2003 77 ff ACM Press network software http://www.citeulike.org/group/290/article/341631 <i>IEEE Transactions on Visualization and Computer Graphics, Vol. 11, No. 4. (July 2005), pp. 457-468.</i><br /><br />Member-Yehuda Koren and Senior Member-Stephen C. North Topological Fisheye Views for Visualizing Large Graphs Emden Gansner doi:10.1109/TVCG.2005.66 IEEE Transactions on Visualization and Computer Graphics, Vol. 11, No. 4. (July 2005), pp. 457-468. 2005-10-05T23:47:49-00:00 2005 IEEE Transactions on Visualization and Computer Graphics 1077-2626 11 4 457 468 IEEE Educational Activities Department interactive largegraph http://www.citeulike.org/group/290/article/100364 <i>(2004), pp. 109-116.</i> The challenge of information visualization evaluation Catherine Plaisant doi:10.1145/989863.989880 (2004), pp. 109-116. 2005-02-22T22:19:19-00:00 2004 109 116 ACM Press user_study http://www.citeulike.org/group/290/article/310710 <i>Journal of Visual Languages and Computing, Vol. 6, No. 3. (1995), pp. 255-273.</i><br /><br />This paper is organized as follows. In section 2, we present an overview on the GraphEd system and the implemented graph drawing algorithms. Section 3 explains our evaluation experiments, and Section 4 shows our results. In Section 5 we give a subjective ranking of layout criteria. 2 GraphEd Comparing and Evaluating Layout Algorithms within GraphEd Michael Himsolt Journal of Visual Languages and Computing, Vol. 6, No. 3. (1995), pp. 255-273. 2005-09-02T05:31:18-00:00 1995 Journal of Visual Languages and Computing 6 3 255 273 layout user_study http://www.citeulike.org/group/290/article/310696 <i>(1995), pp. 76-87.</i><br /><br />. We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], DH by Davidson and Harel [1], Tu by Tunkelang [13] and GEM by Frick, Ludwig and Mehldau [6]. Implementations of these algorithms have been integrated into our GraphEd system [9]. We have tested these algorithms on a wide collection of examples and with different settings of parameters. Our examples... An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms Franz Brandenburg Michael Himsholt Christoph Rohrer (1995), pp. 76-87. 2005-09-02T05:17:09-00:00 1995 76 87 layout user_study http://www.citeulike.org/group/290/article/310695 <i>(2001), pp. 129-137.</i> Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study Helen Purchase Matthew Mcgill Linda Colpoys David Carrington (2001), pp. 129-137. 2005-09-02T05:09:05-00:00 2001 129 137 Australian Computer Society, Inc. layout user_study http://www.citeulike.org/group/290/article/310694 <i>(2001), pp. 5-18.</i> User Preference of Graph Layout Aesthetics: A UML Study Helen Purchase Jo-Anne Allder David Carrington (2001), pp. 5-18. 2005-09-02T05:08:41-00:00 2001 5 18 Springer-Verlag layout user_study http://www.citeulike.org/group/290/article/310692 <i>(1997), pp. 248-261.</i> Which Aesthetic has the Greatest Effect on Human Understanding? Helen Purchase (1997), pp. 248-261. 2005-09-02T05:07:52-00:00 1997 248 261 Springer-Verlag layout user_study http://www.citeulike.org/group/290/article/307877 <i>ACM Transactions on Graphics, Vol. 15, No. 4. (1996), pp. 301-331.</i><br /><br />this article we address the general problem of drawing nice-looking undirected straight-line graphs. Any proposed solution to this problem requires setting general criteria for the "quality" of the picture. Defining such criteria so that they apply to different types of graphs, but at the same time are combined into a meaningful cost function that can then be subjected to general optimization methods, was one of the main objectives of our work. Another was to introduce flexibility, so that the... Drawing graphs nicely using simulated annealing Ron Davidson David Harel ACM Transactions on Graphics, Vol. 15, No. 4. (1996), pp. 301-331. 2005-08-31T06:22:01-00:00 1996 ACM Transactions on Graphics 15 4 301 331 layout http://www.citeulike.org/group/290/article/307592 <i>Softw. Pract. Exper., Vol. 26, No. 12. (December 1996), pp. 1415-1438.</i> Aesthetics-based graph layout for human consumption Michael Coleman Stott Parker doi:10.1002/(SICI)1097-024X(199612)26:12<1415::AID-SPE69>3.3.CO;2-G Softw. Pract. Exper., Vol. 26, No. 12. (December 1996), pp. 1415-1438. 2005-08-31T00:16:04-00:00 1996 Softw. Pract. Exper. 0038-0644 26 12 1415 1438 John Wiley & Sons, Inc. layout http://www.citeulike.org/group/290/article/307559 <i>(February 2004)</i> Visual Clustering of Graphs with nonuniform Degrees Andreas Noack (February 2004) 2005-08-30T20:43:43-00:00 2004 clustering layout http://www.citeulike.org/group/290/article/307555 <i>PROCEEDINGS for the 19th International CODATA Conference THE INFORMATION SOCIETY: NEW HORIZONS FOR SCIENCE (November 2004)</i> Semantic information visualization Martin PROCEEDINGS for the 19th International CODATA Conference THE INFORMATION SOCIETY: NEW HORIZONS FOR SCIENCE (November 2004) 2005-08-30T20:40:02-00:00 2004 PROCEEDINGS for the 19th International CODATA Conference THE INFORMATION SOCIETY: NEW HORIZONS FOR SCIENCE semantic http://www.citeulike.org/group/290/article/307550 <i>(2000), pp. 177-181.</i> A force-directed macro-cell placer Fan Mo Abdallah Tabbara Robert Brayton (2000), pp. 177-181. 2005-08-30T20:36:11-00:00 2000 177 181 IEEE Press layout http://www.citeulike.org/group/290/article/307546 <i>(2004), pp. 89-97.</i> Visualizing Very Large Graphs Using Clustering Neighborhoods. Dunja Mladenic Marko Grobelnik (2004), pp. 89-97. 2005-08-30T20:33:09-00:00 2004 89 97 clustering largegraph http://www.citeulike.org/group/290/article/307541 <i></i> clustering based on semantic relationships in graph visualization Ravi 2005-08-30T20:28:12-00:00 clustering semantic http://www.citeulike.org/group/290/article/307534 <i>(2000)</i><br /><br />Adviser-Pat Hanrahan Interactive visualization of large graphs and networks Tamara Munzner (2000) 2005-08-30T20:22:00-00:00 2000 interactive largegraph http://www.citeulike.org/group/290/article/294538 <i>(2001)</i><br /><br />The emergence of order in natural systems is a constant source of inspiration for both physical and biological sciences. While the spatial order characterizing for example the crystals has been the basis of many advances in contemporary physics, most complex systems in nature do not offer such high degree of order. Many of these systems form complex networks whose nodes are the elements of the system and edges represent the interactions between them. Statistical mechanics of complex networks R Albert (2001) 2005-08-16T18:35:15-00:00 2001 largegraph http://www.citeulike.org/group/290/article/307531 <i>Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005)</i> Creating Social Networks to Improve Peer-to-Peer Networking Fast Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005) 2005-08-30T20:17:08-00:00 2005 Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining application datamining social_network http://www.citeulike.org/group/290/article/307528 <i>National Academy of Sciences Symposium on Dynamic Social Network Analysis (2002)</i> Data mining in social networks Jensen National Academy of Sciences Symposium on Dynamic Social Network Analysis (2002) 2005-08-30T20:15:22-00:00 2002 National Academy of Sciences Symposium on Dynamic Social Network Analysis datamining social_network http://www.citeulike.org/group/290/article/163220 <i>ACM Trans. Comput.-Hum. Interact., Vol. 10, No. 1. (March 2003), pp. 54-85.</i> Experiments in social data mining: The TopicShop system Brian Amento Loren Terveen Will Hill Deborah Hix Robert Schulman doi:10.1145/606658.606661 ACM Trans. Comput.-Hum. Interact., Vol. 10, No. 1. (March 2003), pp. 54-85. 2005-04-17T23:55:03-00:00 2003 ACM Trans. Comput.-Hum. Interact. 1073-0516 10 1 54 85 ACM Press datamining social_network http://www.citeulike.org/group/290/article/163559 <i>(14 April 2005)</i><br /><br />An important task for Homeland Security is the prediction of threat vulnerabilities, such as through the detection of relationships between seemingly disjoint entities. A structure used for this task is a "semantic graph", also known as a "relational data graph" or an "attributed relational graph". These graphs encode relationships as "typed" links between a pair of "typed" nodes. Indeed, semantic graphs are very similar to semantic networks used in AI. The node and link types are related through an ontology graph (also known as a schema). Furthermore, each node has a set of attributes associated with it (e.g., "age" may be an attribute of a node of type "person"). Unfortunately, the selection of types and attributes for both nodes and links depends on human expertise and is somewhat subjective and even arbitrary. This subjectiveness introduces biases into any algorithm that operates on semantic graphs. Here, we raise some knowledge representation issues for semantic graphs and provide some possible solutions using recently developed ideas in the field of complex networks. In particular, we use the concept of transitivity to evaluate the relevance of individual links in the semantic graph for detecting relationships. We also propose new statistical measures for semantic graphs and illustrate these semantic measures on graphs constructed from movies and terrorism data. Knowledge Representation Issues in Semantic Graphs for Relationship Detection Marc Barthelemy Edmond Chow Tina Eliassi-Rad (14 April 2005) 2005-04-18T16:38:11-00:00 2005 ontology http://www.citeulike.org/group/290/article/307515 <i>Knowledge-Based Intel- ligent Information and Engineering Systems (2002)</i> Clustering Using Small World Structure Y Matsuo Knowledge-Based Intel- ligent Information and Engineering Systems (2002) 2005-08-30T19:53:10-00:00 2002 Knowledge-Based Intel- ligent Information and Engineering Systems clustering smallworld http://www.citeulike.org/group/290/article/307510 <i>Math Awareness Month 2004, Vol. 37(3) (April 2004)</i> The Small-World Phenomenon and Decentralized Search J Kleinberg Math Awareness Month 2004, Vol. 37(3) (April 2004) 2005-08-30T19:48:41-00:00 2004 Math Awareness Month 2004 37(3) smallworld http://www.citeulike.org/group/290/article/129 <i>Proc Natl Acad Sci U S A, Vol. 97, No. 21. (10 October 2000), pp. 11149-11152.</i><br /><br />We study the statistical properties of a variety of diverse real-world networks. We present evidence of the occurrence of three classes of small-world networks: (a) scale-free networks, characterized by a vertex connectivity distribution that decays as a power law; (b) broad-scale networks, characterized by a connectivity distribution that has a power law regime followed by a sharp cutoff; and (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail. Moreover, we note for the classes of broad-scale and single-scale networks that there are constraints limiting the addition of new links. Our results suggest that the nature of such constraints may be the controlling factor for the emergence of different classes of networks. Classes of small-world networks. LA Amaral A Scala M Barthelemy HE Stanley doi:10.1073/pnas.200327197 Proc Natl Acad Sci U S A, Vol. 97, No. 21. (10 October 2000), pp. 11149-11152. 2004-11-22T00:17:30-00:00 2000 Proc Natl Acad Sci U S A 0027-8424 97 21 11149 11152 smallworld http://www.citeulike.org/group/290/article/307506 <i>ACM Comput. Surv., Vol. 34, No. 3. (September 2002), pp. 313-356.</i> A survey of graph layout problems Josep D&\#237;az Jordi Petit Maria Serna doi:10.1145/568522.568523 ACM Comput. Surv., Vol. 34, No. 3. (September 2002), pp. 313-356. 2005-08-30T19:34:54-00:00 2002 ACM Comput. Surv. 0360-0300 34 3 313 356 ACM Press layout http://www.citeulike.org/group/290/article/307505 <i>(1998), pp. 364-373.</i> Improved Force-Directed Layouts Emden Gansner Stephen North (1998), pp. 364-373. 2005-08-30T19:31:17-00:00 1998 364 373 Springer-Verlag layout http://www.citeulike.org/group/290/article/81501 <i>Proc Natl Acad Sci U S A, Vol. 99, No. 12. (11 June 2002), pp. 7821-7826.</i><br /><br />A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well known--a collaboration network and a food web--and find that it detects significant and informative community divisions in both cases. Community structure in social and biological networks. M Girvan ME Newman doi:10.1073/pnas.122653799 Proc Natl Acad Sci U S A, Vol. 99, No. 12. (11 June 2002), pp. 7821-7826. 2005-01-21T16:03:08-00:00 2002 Proc Natl Acad Sci U S A 0027-8424 99 12 7821 7826 clustering social_network http://www.citeulike.org/group/290/article/274569 <i>The European Physical Journal B - Condensed Matter, Vol. 13, No. 3. (January 2000), pp. 547-560.</i><br /><br />Abstract: We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties resulting from the coexistence of a local structure and random long-range connections, and we examine their evolution with size and disorder strength. We show that any finite value of the disorder is able to trigger a "small-world" behaviour as soon as the initial lattice is big enough, and study the crossover between a regular lattice and a "small-world" one. These results are corroborated by the investigation of an Ising model defined on the network, showing for every finite disorder fraction a crossover from a high-temperature region dominated by the underlying one-dimensional structure to a mean-field like low-temperature region. In particular there exists a finite-temperature ferromagnetic phase transition as soon as the disorder strength is finite. [0.5cm] On the properties of small-world network models A Barrat M Weigt doi:10.1007/s100510050067 The European Physical Journal B - Condensed Matter, Vol. 13, No. 3. (January 2000), pp. 547-560. 2005-08-05T10:49:41-00:00 2000 The European Physical Journal B - Condensed Matter 13 3 547 560 smallworld http://www.citeulike.org/group/290/article/307503 <i>(2002), pp. 36-48.</i> Ontology-based Information Visualization. Christiaan Fluit Marta Sabou Frank van Harmelen (2002), pp. 36-48. 2005-08-30T19:25:09-00:00 2002 36 48 ontology http://www.citeulike.org/group/290/article/121514 <i>Comparative and Functional Genomics, Vol. 6, No. 1-2. (February 2005), pp. 67-71.</i> Ontology-based interactive information extraction from scientific abstracts Milward David Bjareland Marcus Hayes William Maxwell Michelle Oberg Lisa Tilford Nick Thomas James Hale Roger Knight Sylvia Barnes Julie doi:10.1002/cfg.456 Comparative and Functional Genomics, Vol. 6, No. 1-2. (February 2005), pp. 67-71. 2005-03-11T13:52:51-00:00 2005 Comparative and Functional Genomics 1531-6912 6 1-2 67 71 John Wiley & Sons, Ltd. interactive ontology http://www.citeulike.org/group/290/article/307490 <i>(2003)</i> Visualization of Semantic Metadata and Ontologies Paul Mutton Jennifer Golbeck (2003) 2005-08-30T19:00:26-00:00 2003 IEEE Computer Society ontology semantic_web http://www.citeulike.org/group/290/article/101305 <i>Information Technology and Management, Vol. 6, No. 1. (January 2005), pp. 89-96.</i> Exploiting the Small-Worlds of the Semantic Web to Connect Heterogeneous, Local Ontologies Henry Kim Markus Biehl doi:10.1007/s10799-004-7776-1 Information Technology and Management, Vol. 6, No. 1. (January 2005), pp. 89-96. 2005-02-23T05:28:44-00:00 2005 Information Technology and Management 1385-951X 6 1 89 96 Kluwer Academic Publishers ontology semantic_web smallworld