Classification of web documents using a graph model

Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

Volumn 2003-January, Issue , 2003, Pages 240-244

  Schenker, Adam ^a   Last, Mark ^b   Bunke, Horst ^c   Kandel, Abraham ^a  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; NEAREST NEIGHBOR SEARCH; PATTERN RECOGNITION;

CLASSIFICATION ACCURACY; DOCUMENT REPRESENTATION; EXECUTION TIME; GRAPH-BASED MODELING; K NEAREST NEIGHBOR (K NN) ALGORITHM; K-NN ALGORITHM; VECTOR MODELS; WEB DOCUMENT COLLECTION;

INFORMATION RETRIEVAL SYSTEMS;

EID: 84906058556     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.2003.1227666     Document Type: Conference Paper

References (16)

1. C. Apte, F. Damerau, and S. M. Weiss, "Automated Learning of Decision Rules for Text Categorization", ACM Transactions on Information Systems, Vol. 12, No. 3, 1994, pp. 233-251.
2. H Bunke, "Recent developments in graph matching", Proceedings of the 15th International Conference on Pattern Recognition, Barcelona, Vol. 2, 2000, pp. 117-124.
3. H. Bunke and K. Shearer, "A graph distance metric based on the maximal common subgraph", Pattern Recognition Letters, Vol. 19, 1998, pp. 255-259.
4. M. Crochemore and R. Vérin, "Direct construction of compact directed acyclic word graphs" in CPM97, A. Apostolico and J. Hein (eds.), Springer-Verlag, 1997.
5. M.-L. Fernández and G. Valiente, "A graph distance metric combining maximum common subgraph and minimum common supergraph", Pattern Recognition Letters, Vol. 22, 2001, pp. 753-758.
6. M. Lazarescu, H. Bunke, and S. Venkatesh, "Graph matching: Fast candidate elimination using machine learning techniques", Advances in Pattern Recognition, Joint IAPR International Workshops SSPR and SPR 2000, Lecture Notes in Computer Science, Vol. 1876, 2000, pp. 236-245.
7. J. Liang and D. Doermann, "Logical labeling of document images using layout graph matching with adaptive learning", in Document Analysis Systems V, D. Lopresti, J. Hu, R. Kashi (eds.), Springer-Verlag, LNCS 2423, 2002, pp. 224-235.
8. D. Lopresti and G. Wilfong, "Applications of graph probing to web document analysis", Proceedings of the 1st International Workshop on Web Document Analysis (WDA2001), 2001, pp. 51-54.
9. X. Lu, "Document retrieval: A structural approach", Information Processing and Management, Vol. 26, No. 2, 1990, pp. 209-218.
10. A. McCallum and K. Nigam, "A comparison of event models for Naive Bayes text classification", AAAI-98 Workshop on Learning for Text Categorization, 1998.
11. B. T. Messmer and H. Bunke, "A new algorithm for errortolerant subgraph isomorphism detection", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 20, 1998, pp. 493-504.
12. T. M. Mitchell, Machine Learning, McGraw-Hill, Boston, 1997.
13. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice-Hall, Upper Saddle River, 1995.
14. G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer, Addison- Wesley, Reading, 1989.
15. C.-M. Tan, Y.-F. Wang, and C.-D. Lee, "The use of bigrams to enhance text categorization", Information Processing and Management, Vol. 38, 2002, pp. 529-546.
16. W. D. Wallis, P. Shoubridge, M. Kraetz, and D. Ray, "Graph distances using graph union", Pattern Recognition Letters, Vol. 22, 2001, pp. 701-704.