Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Practitioner's Guide for Static Index Pruning
Download
index.pdf
Date
2009-01-01
Author
Altıngövde, İsmail Sengör
Ulusoy, Oezguer
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
167
views
67
downloads
Cite This
We compared the term- and document-centric static index pruning approaches as described in the literature and investigate their sensitivity to the scoring functions employed during the pruning and actual retrieval stages.
Subject Keywords
Inverted index
,
Document length
,
Retrieval effectiveness
,
Retrieval function
,
Actual retrieval
URI
https://hdl.handle.net/11511/42305
DOI
https://doi.org/10.1007/978-3-642-00958-7_65
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
A Theoretical Analysis of Multi-Modal Representation Learning with Regular Functions
Vural, Elif (2021-01-07)
Multi-modal data analysis methods often learn representations that align different modalities in a new common domain, while preserving the within-class compactness and within-modality geometry and enhancing the between-class separation. In this study, we present a theoretical performance analysis for multi-modal representation learning methods. We consider a quite general family of algorithms learning a nonlinear embedding of the data space into a new space via regular functions. We derive sufficient condit...
Dynamic performances of kinematically and dynamically adjustable planar mechanisms
İyiay, Erdinç; Soylu, Reşit; Department of Mechanical Engineering (2003)
In this thesis, the dynamic performances of kinematically and dynamically adjustable planar mechanisms have been investigated. An adjustable mechanism is here defined to be a mechanism where some of the kinematic and/or dynamic parameters are changed in a controlled manner in order to optimize the dynamic behaviour of the mechanism in spite of variable operating conditions. Here, variable operating conditions refer to variable load(s) on the mechanism and/or variable desired input motion. The dynamic behavi...
A verification approach for dynamics of metamodel based conceptual models of the mission space
Eryılmaz, Utkan; Bilgen, Semih; Department of Information Systems (2011)
Conceptual models were introduced in the simulation world in order to describe the problem domain in detail before any implementation is attempted. One of the recent approaches for conceptual modeling of the military mission space is the KAMA approach which provides a process description, a UML based notation, and a supporting tool for developing conceptual models. The prominence of the approach stems from availability of guidance and applications in real life case studies. Although the credibility of a con...
Reducing inconsistencies in intuitionistic 2-way adaptive fuzzy control systems
Gurkan, E; Erkmen, Aydan Müşerref; Erkmen, İsmet (2000-08-30)
Our objective in this paper is to model and reduce inconsistency in expert knowledge for our proposed 2-way adaptive fuzzy system that makes use of intuitionistic fuzzy sets. Intuitionistic fuzzy sets model an interval valued distribution of information in the adaptive control architecture with the necessity at the lower bound as the degree of membership functions and the possibility at the upper bound as the complement of the degree of nonmembership functions. Uncertainty is modelled as the width of this i...
Algorithms for within-cluster searches using inverted files
Altıngövde, İsmail Sengör; Ulusoy, Ozgur (2006-01-01)
Information retrieval over clustered document collections has two successive stages: first identifying the best-clusters and then the best-documents in these clusters that are most similar to the user query. In this paper, we assume that an inverted file over the entire document collection is used for the latter stage. We propose and evaluate algorithms for within-cluster searches, i.e., to integrate the best-clusters with the best-documents to obtain the final output including the highest ranked documents ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
İ. S. Altıngövde and O. Ulusoy, “A Practitioner’s Guide for Static Index Pruning,” 2009, vol. 5478, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42305.