Abstract
A star-graph is a conceptual graph that contains a single relation, with some concepts linked to it. They are elementary pieces of information describing combinations of concepts. We use star-graphs as descriptors — or index terms — for image content representation. This allows for relational indexing and expression of complex user needs, in comparison to classical text retrieval, where simple keywords are generally used as document descriptors. In classical text retrieval, the keywords are weighted to give emphasis to good document descriptors and discriminators where the most popular weighting schemes are based on variations of tf.idf. In this paper, we present an extension of tf.idf, introducing a new weighting scheme suited for star-graphs. This weighting scheme is based on a local analysis of star-graphs indexing a document and a global analysis of star-graphs across the whole collection. We show and discuss some preliminary results evaluating the performance of this weighting scheme applied to image retrieval.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Amati and I. Ounis. Conceptual graphs and first order logic. The Computer Journal, 43(1): 1–12, 2000.
E. Bertino and B. Catania. A constraint-based approach to shape management in multimedia databases. ACM Multimedia Journal, 6(1):2–16, 1998.
Y. Chiaramella and M. Mechkour. Indexing an image test collection. Technical Report, FERMI BRA 8134, 1997.
J.-H. Lim. Building visual vocabulary for image indexation and query formulation. Pattern Analysis and Applications (Special Issue on Image Indexation), 4(2/3):125–139, 2001.
J. Martinet, Y. Chiaramella, and P. Mulhem. Un modèle vectoriel étendu de recherche d’information adapté aux images. In INFORSID’02, pages 337–348, 2002.
M. Mechkour. Un Modele etendu de representation et de correspondance d’images pour la recherche d’informations. Ph.D. Thesis, Joseph Fourier University, Grenoble, 1995.
I. Ounis and M. Pasca. Relief: Combing expressiveness and rapidity into a single system. In SIGIR’98, pages 266–274, 1998.
I. Ounis. A flexible weighting scheme for multimedia documents. In Database and Expert Systems Applications, pages 392–405, 1999.
G. Salton. The SMART Retrieval System. Prentice Hall, 1971.
G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. In Information Processing and Management, pages 513–523, 1988.
G. Salton and M. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
E. Di Sciascio, F. M. Donini, and M. Mongiello. Structured knowledge representation for image retrieval. Journal of Artificial Intelligence Research, 16:209–257, 2002.
J. F. Sowa. Conceptual Structures. Addison-Wesley, Reading, MA, 1984.
J. Z. Wang and Y. Du. Rf*ipf: A weighting scheme for multimedia information retrieval. In ICIAP, pages 380–385, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martinet, J., Ounis, I., Chiaramella, Y., Mulhem, P. (2003). A Weighting Scheme for Star-Graphs. In: Sebastiani, F. (eds) Advances in Information Retrieval. ECIR 2003. Lecture Notes in Computer Science, vol 2633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36618-0_41
Download citation
DOI: https://doi.org/10.1007/3-540-36618-0_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01274-0
Online ISBN: 978-3-540-36618-8
eBook Packages: Springer Book Archive