ACM Home Page
Please provide us with feedback. Feedback
An analysis of multimedia searching on AltaVista
Full text PdfPdf (498 KB)
Source International Multimedia Conference archive
Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval table of contents
Berkeley, California
POSTER SESSION: Posters table of contents
Pages: 186 - 192  
Year of Publication: 2003
ISBN:1-58113-778-8
Authors
Bernard J. Jansen  The Pennsylvania State University, University Park, PA
Amanda Spink  University of Pittsburgh, Pittsburgh PA
Jan Pedersen  Overture, Web Services Division, Palo Alto, CA
Sponsor
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 49,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/973264.973294
What is a DOI?

ABSTRACT

Web searching is a significant activity for many people seeking multimedia information. Major Web search engines, such as Alta Vista, are essential tools in the quest to locate relevant online information. As such, it is important that we understand how searchers utilize these Web information systems. This paper presents research that examines characteristics of multimedia Web searching on Alta Vista. More specifically, the research questions driving this study are: (1) What are the characteristics of multimedia searching on Alta Vista? and (2) How does this multimedia searching compare to Web searching in general? The results of our research show that multimedia searching is complex relative to general Web searching and that searching specific multimedia collections does not necessarily reduce the searching complexity. We discuss the implications of the findings for the development of online multimedia retrieval systems.


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
J. I. Cole, M. Suman, P. Schramm, R. Lunn, and J. S. Aquino, "The UCLA Internet Report Surveying the Digital Future Year Three," vol. 2003: UCLA Center for Communication Policy, 2003.
 
2
 
3
J. R. Smith, "Webseek at Columbia University," vol. 2003, 2003.
 
4
 
5
 
6
 
7
 
8
9
 
10
D. Sullivan, "Nielsen / NetRatings Search Engine Ratings," vol. 2002: SearchEngineWatch.com, 2002.
 
11
D. Sullivan, "Search Engine Sizes," vol. 2000, 2000.
 
12
Alta Vista, "Special search terms," vol. 2003: Alta Vista, 2003.
 
13
B. Morrissey, "Overture to Buy AltaVista," vol. 2003: Internet Advertising Report, 2003.
 
14
B. Berkowitz, "Yahoo! to Buy Overture in $1.63 Bln Deal," in Reuter. Los Angeles, CA, USA, 2003.
 
15
C. Djeraba, "When Image Indexing Meets Knowledge Discovery," in Proceedings of Sixth ACM SIGKDD International Conference on Know edge Discovery and Data Mining, Boston, MA, USA, 2000.
16
 
17
18
 
19
S. Lawrence and C. L. Giles, "Searching the World Wide Web," Science, vol. 280, pp. 98--100, 1998.
 
20
 
21
 
22
 
23
Alexa Insider, "Alexa insider's page," vol. 2000: Alexa Insider, 2000.
 
24
G. Abdulla, B. Liu, and E. Fox, "Searching the World-Wide Web: Implications from Studying Different User Behavior," in Proceedings of the World Conference of the World Wide Web, Internet, and Intranet, Orlando, FL, 1998.
 
25
 
26
 
27
 
28
E. Selberg and O. Etzioni, "The MetaCrawler architecture for resource aggregation on the Web," IEEE Expert, vol. 12, pp. 11 - 14, 1997.
 
29
D. Wolfram, "Term Co-occurrence in Internet Search Engine Queries: An Analysis of the Excite Data Set," Canadian Journal of Information and Library Science, vol. 24, pp. 12--33, 1999.

CITED BY  7

Collaborative Colleagues:
Bernard J. Jansen: colleagues
Amanda Spink: colleagues
Jan Pedersen: colleagues

Peer to Peer - Readers of this Article have also read: