USING A GRAPH MODEL

Department of Computer Science and Engineering, University of South Florida, 4202 E. Fowler Ave. ENB 118 Tampa, FL, 33620, USA E-mail: aschenke, kandel@csee.usf.edu Department of Information Systems Engineering, Ben-Gurion University of the Negev Beer-Sheva 84105, Israel E-mail: mlast@bgumail.bgu.ac.il Inst. Fur Informatik und angewandte Mathematik, Department of Computer Science, University of Bern, Neubrückstrasse 10, CH-3012 Bern, Switzerland E-mail: bunke@iam.unibe.ch

[1]  Gordon Wilfong,et al.  Applications of Graph Probing to Web Document Analysis , 2003, Web Document Analysis.

[2]  Miro Kraetzl,et al.  Graph distances using graph union , 2001, Pattern Recognit. Lett..

[3]  Gabriel Valiente,et al.  A graph distance metric combining maximum common subgraph and minimum common supergraph , 2001, Pattern Recognit. Lett..

[4]  Horst Bunke,et al.  Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching , 2001, ICAPR.

[5]  Abraham Kandel,et al.  On the Minimum Common Supergraph of Two Graphs , 2000, Computing.

[6]  Abraham Kandel,et al.  Mean and maximum common subgraph of two graphs , 2000, Pattern Recognit. Lett..

[7]  R. Mooney,et al.  Impact of Similarity Measures on Web-page Clustering , 2000 .

[8]  Vipin Kumar,et al.  Partitioning-based clustering for Web document categorization , 1999, Decis. Support Syst..

[9]  Ravi Kumar,et al.  Extracting Large-Scale Knowledge Bases from the Web , 1999, VLDB.

[10]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[11]  Brian D. Davison,et al.  Human Performance on Clustering Web Pages: A Preliminary Study , 1998, KDD.

[12]  Oren Etzioni,et al.  Web document clustering: a feasibility demonstration , 1998, SIGIR '98.

[13]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[15]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[16]  Maxime Crochemore,et al.  Direct Construction of Compact Directed Acyclic Word Graphs , 1997, CPM.

[17]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[18]  Kaizhong Zhang,et al.  Algorithms for Approximate Graph Matching , 1995, Inf. Sci..

[19]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[21]  Xin Lu.  Document retrieval: A structural approach , 1990, Inf. Process. Manag..

[22]  Gerard Salton,et al.  Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .

[23]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[24]  G. Levi.  A note on the derivation of maximal common subgraphs of two directed or undirected graphs , 1973 .

[25]  Jack Minker,et al.  An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.