ACM Home Page
Please provide us with feedback. Feedback
QProber: A system for automatic classification of hidden-Web databases
Full text PdfPdf (3.62 MB)
Source ACM Transactions on Information Systems (TOIS) archive
Volume 21 ,  Issue 1  (January 2003) table of contents
Pages: 1 - 41  
Year of Publication: 2003
ISSN:1046-8188
Authors
Luis Gravano  Columbia University, Amsterdam, New York, NY
Panagiotis G. Ipeirotis  Columbia University, Amsterdam, New York, NY
Mehran Sahami  Stanford University, Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 98,   Citation Count: 31
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/635484.635485
What is a DOI?

ABSTRACT

The contents of many valuable Web-accessible databases are only available through search interfaces and are hence invisible to traditional Web "crawlers." Recently, commercial Web sites have started to manually organize Web-accessible databases into Yahoo!-like hierarchical classification schemes. Here we introduce QProber, a modular system that automates this classification process by using a small number of query probes, generated by document classifiers. QProber can use a variety of types of classifiers to generate the probes. To classify a database, QProber does not retrieve or inspect any documents or pages from the database, but rather just exploits the number of matches that each query probe generates at the database in question. We have conducted an extensive experimental evaluation of QProber over collections of real documents, experimenting with different types of document classifiers and retrieval models. We have also tested our system with over one hundred Web-accessible databases. Our experiments show that our system has low overhead and achieves high classification accuracy across a variety of databases.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Agichtein, E. and Gravano, L. 2003. Querying text databases for efficient information extraction. In Proceedings of the Nineteenth IEEE International Conference on Data Engineering (ICDE 2003).
 
3
4
 
5
6
7
 
8
Cleverdon, C. W. and Mills, J. 1963. The testing of index language devices. Aslib Proc. 15, 4, 106--130.
 
9
Cohen, W. and Singer, Y. 1996. Learning to query the Web. In AAAI Workshop on Internet-Based Information Systems, 16--25.
 
10
Cohen, W. W. 1996. Learning trees and rules with set-valued features. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96) Eighth Conference on Innovative Applications of Artificial Intelligence (IAAI-96), 709--716.
11
 
12
 
13
Deerwester, S. C., Dumais, S. T., Landauer, T. K., Furnas, G. W., and Harshman, R. A. 1990. Indexing by latent semantic analysis. J. Amer. Soc. Inf. Sci. 41, 6, 391--407.
14
 
15
Duda, R. O. and Hart, P. E. 1973. Pattern Classification and Scene Analysis. Wiley, New York.
16
17
 
18
Gauch, S., Wang, G., and Gomez, M. 1996. ProFusion*: Intelligent fusion from multiple, distributed search engines. J. Univ. Comput. Sci. 2, 9 (Sept.), 637--649.
19
20
 
21
Gravano, L., Ipeirotis, P. G., and Sahami, M. 2002. Query- vs. crawling-based classification of searchable web databases. IEEE Data Eng. Bull. 25, 1 (Mar.), 43--50.
 
22
Grefenstette, G. and Nioche, J. 2000. Estimation of English and non-English language use on the WWW. In Recherche d'Information Assistée par Ordinateur (RIAO 2000).
23
 
24
Ipeirotis, P. G. and Gravano, L. 2002. Distributed search over the hidden Web: Hierarchical database sampling and selection. In Proceedings of the 28th International Conference on Very Large Databases (VLDB 2002).
25
26
 
27
 
28
Johnston, R. 1971. Gershgorin theorems for partitioned matrices. Lin. Algeb. Appl. 4, 3 (July), 205--220.
 
29
 
30
 
31
Koller, D. and Sahami, M. 1996. Toward optimal feature selection. In Proceedings of the Thirteenth International Conference on Machine Learning (ICML'96), 284--292.
 
32
 
33
Koster, M. 2002. Robots exclusion standard. Available at http://www.robotstxt.org/.
34
 
35
McCallum, A. and Nigam, K. 1998. A comparison of event models for naive Bayes text classification. In Learning for Text Categorization: Papers from the 1998 AAAI Workshop, 41--48.
 
36
 
37
 
38
 
39
 
40
 
41
 
42
 
43
Rocchio, J. 1971. Relevance feedback in information retrieval. In The SMART Information Retrieval System. Prentice-Hall, Englewood Cliffs, NJ, 313--323.
 
44
 
45
 
46
 
47
48
 
49
 
50
 
51
52
53
 
54
Yangarber, R. and Grishman, R. 1998. NYU: Description of the Proteus/PET system as used for MUC-7. In Proceedings of the Seventh Message Understanding Conference (MUC-7).
 
55
Zipf, G. K. 1949. Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading, MA.

CITED BY  31

Collaborative Colleagues:
Luis Gravano: colleagues
Panagiotis G. Ipeirotis: colleagues
Mehran Sahami: colleagues