String Processing and Information Retrieval

1. Front Matter

   PDF

2. Web Clustering and Text Categorization

   1. MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization

      • Andrea Esuli, Tiziano Fagni, Fabrizio Sebastiani

      Pages 1-12

   2. TreeBoost.MH: A Boosting Algorithm for Multi-label Hierarchical Text Categorization

      • Andrea Esuli, Tiziano Fagni, Fabrizio Sebastiani

      Pages 13-24

   3. Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution

      • Filippo Geraci, Marco Pellegrini, Marco Maggini, Fabrizio Sebastiani

      Pages 25-36

   4. Principal Components for Automatic Term Hierarchy Building

      • Georges Dupret, Benjamin Piwowarski

      Pages 37-48

3. Strings

   1. Computing the Minimum Approximate λ-Cover of a String

      • Qing Guo, Hui Zhang, Costas S. Iliopoulos

      Pages 49-60

   2. Sparse Directed Acyclic Word Graphs

      • Shunsuke Inenaga, Masayuki Takeda

      Pages 61-73

   3. On-Line Repetition Detection

      • Jin-Ju Hong, Gen-Huey Chen

      Pages 74-85

4. User Behavior

   1. Analyzing User Behavior to Rank Desktop Items

      • Paul-Alexandru Chirita, Wolfgang Nejdl

      Pages 86-97

   2. The Intention Behind Web Queries

      • Ricardo Baeza-Yates, Liliana Calderón-Benavides, Cristina González-Caro

      Pages 98-109

5. Web Search Algorithms

   1. Compact Features for Detection of Near-Duplicates in Distributed Retrieval

      • Yaniv Bernstein, Milad Shokouhi, Justin Zobel

      Pages 110-121

   2. Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory

      • Simon J. Puglisi, W. F. Smyth, Andrew Turpin

      Pages 122-133

   3. Efficient Lazy Algorithms for Minimal-Interval Semantics

      • Paolo Boldi, Sebastiano Vigna

      Pages 134-149

   4. Output-Sensitive Autocompletion Search

      • Holger Bast, Christian W. Mortensen, Ingmar Weber

      Pages 150-162

6. Compression

   1. A Compressed Self-index Using a Ziv-Lempel Dictionary

      • Luís M. S. Russo, Arlindo L. Oliveira

      Pages 163-180

   2. Mapping Words into Codewords on PPM

      • Joaquín Adiego, Pablo de la Fuente

      Pages 181-192

7. Correction

   1. Improving Usability Through Password-Corrective Hashing

      • Andrew Mehler, Steven Skiena

      Pages 193-204

   2. Word-Based Correction for Retrieval of Arabic OCR Degraded Documents

      • Walid Magdy, Kareem Darwish

      Pages 205-216

8. Information Retrieval Applications

   1. A Statistical Model of Query Log Generation

      • Georges Dupret, Benjamin Piwowarski, Carlos Hurtado, Marcelo Mendoza

      Pages 217-228

   2. Using String Comparison in Context for Improved Relevance Feedback in Different Text Media

      • Adenike M. Lam-Adesina, Gareth J. F. Jones

      Pages 229-241

This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The SPIRE annual symposium provides an opportunity for both new and established researchers to present original contributions to areas such as string processing (dictionary algorithms, text searching, pattern matching, text c- pression, text mining, natural language processing, and automata-based string processing); information retrieval languages, applications, and evaluation (IR modelling, indexing, ranking and ?ltering, interface design, visualization, cro- lingual IR systems, multimedia IR, digital libraries, collaborative retrieval, W- related applications, XML, information retrieval from semi-structured data, text mining, and generation of structured data from text); and interaction of biology and computation (sequencing and applications in molecular biology, evolution and phylogenetics, recognition of genes and regulatory elements, and sequen- driven protein structure prediction). The papers in this volume were selected from 102 papers submitted from over 20 di?erent countries in response to the Call for Papers. A total of 26 submissions were accepted as full papers, yielding an acceptance rate of about 25%. In view of the large number of good-quality submissions the Program Committee decided to accept 5 short papers, that have also been included in the proceedings. SPIRE 2006 also featured two talks by invited speakers: Jamie Callan (Carnegie Mellon University, USA) and Martin Farach-Colton (Rutgers University, USA).

• DNA analysis
• NLP
• computational biology
• data analysis
• data compression
• digital libraries
• genome analysis
• information retrieval
• machine learning
• pattern discovery
• pattern matching
• search algorithms
• searching
• string mataching
• string searching;
• data structures
• algorithm analysis and problem complexity

• Department of Computer and Information Science, University of Strathclyde, Scotland

  Fabio Crestani

• Dipartimento di Informatica, University of Pisa, Pisa, Italy

  Paolo Ferragina

• Department of Information Studies, University of Sheffield, Sheffield, UK

  Mark Sanderson

Policies and ethics