Loading...
Search for:
information-retrieval
0.005 seconds
Total 79 records
Logic-based XML information retrieval for determining the best element to retrieve
, Article Third International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2004: Advances in XML Information Retrieval, Dagstuhl Castle, 6 December 2004 through 8 December 2004 ; Volume 3493 , 2005 , Pages 88-99 ; 03029743 (ISSN) ; Habibi, J ; Oroumchian, F ; Sharif University of Technology
Springer Verlag
2005
Abstract
This paper presents UOWD-Sharif team's approach for XML information retrieval. This approach is an extension of PLIR which is an experimental knowledge-based information retrieval system. This system like PLIR utilizes plausible inferences to first infer the relevance of sentences in XML documents and then propagates the relevance to the other textual units in the document tree. Two approaches have been used for propagation of confidence. The first approach labeled "propagate-DS" first propagates the confidence from sentences to upper elements and then combines these evidences by applying Dempster-Shafer theory of evidence to estimate the confidence in that element. The second approach...
Private Information Retrieval for a Multi-Message Scenario with Private Side Information
, Article IEEE Transactions on Communications ; Volume 69, Issue 5 , 2021 , Pages 3235-3244 ; 00906778 (ISSN) ; Shariatpanahi, S. P ; Maddah Ali, M. A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
We consider the problem of private information retrieval (PIR), where a single user with private side information (PSI) aims to retrieve multiple files from a library stored at some servers. We assume that the side information (SI) at the user includes a subset of files stored privately. Moreover, the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load transmitted from the servers to the user such that the requested files can be decoded with the help of received data and side information. By providing matching lower and upper bounds for certain regimes, we characterize the minimum load imposed on all the...
Revisiting optimal rank aggregation: A dynamic programming approach
, Article ICTIR 2015 - Proceedings of the 2015 ACM SIGIR International Conference on the Theory of Information Retrieval, 27 September 2015 through 30 September 2015 ; 2015 , Pages 353-356 ; 9781450338332 (ISBN) ; Dadashkarimi, J ; Dehghani, M ; Esfahani, H. N ; Shakery, A ; Sharif University of Technology
Association for Computing Machinery, Inc
2015
Abstract
Rank aggregation, that is merging multiple ranked lists, is a pivotal challenge in many information retrieval (IR) systems, especially in distributed IR and multilingual IR. From the evaluation point of view, being able to calculate the upper-bound of performance of the final aggregated list lays the ground for evaluating different aggregation strategies, independently. In this paper, we propose an algorithm based on dynamic programming which, using relevancy information, obtains the aggregated list with the maximum performance that could be possibly achieved by any aggregation strategy. We also provide a detailed proof for the optimality of the result of the algorithm. Furthermore, we...
A fuzzy learning model for retrieving and learning information in visual working brain memory mechanism
, Article 2017 25th Iranian Conference on Electrical Engineering, ICEE 2017, 2 May 2017 through 4 May 2017 ; 2017 , Pages 61-64 ; 9781509059638 (ISBN) ; Bagheri Shouraki, S ; Jahed, M ; Sharif University of Technology
Abstract
In this investigation, the idea of Visual Working Memory (VWM) mechanism modeling based on versatile fuzzy method; Active Learning method, is presented. Visual information process; retrieving and learning rely on the use of Ink Drop Spread (IDS) and Center of Gravity (COG) as spatial density convergence operators. IDS modeling is characterized by processing that uses intuitive pattern information instead of complex formulas, and it is capable of stable and fast convergence. Furthermore, because it approves that distortion in retrieving irrelative data is adaptive to avoid storing lots of repetitive external information in daily visualization. Subsequently, this distortion is analyzed via two...
Multi-message private information retrieval with private side information
, Article 2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018 ; 2019 ; 9781538635995 (ISBN) ; Jafari Siavoshani, M ; Maddah Ali, M. A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2019
Abstract
We consider the problem of private information retrieval (PIR) where a single user with private side information aims to retrieve multiple files from a library stored (uncoded) at a number of servers. We assume the side information at the user includes a subset of files stored privately (i.e., the server does not know the indices of these files). In addition, we require that the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load to be transmitted from the servers to the user such that the requested files can be decoded with the help of received and side information. By providing matching lower and upper...
Evaluation of test collection construction methods: A case study
, Article 2008 International Conference on Information and Knowledge Engineering, IKE 2008, Las Vegas, NV, 14 July 2008 through 17 July 2008 ; January , 2008 , Pages 16-22 ; 1601320752 (ISBN); 9781601320759 (ISBN) ; Hosseini, M ; Rostami, A ; Abolhassani, H ; Sharif University of Technology
2008
Abstract
Currently there is no standard test collection for evaluation of Farsi information retrieval systems. In this paper we introduce Mahak, the first complete test collection generally available for evaluating Farsi information retrieval systems. In addition, we have used different methods for constructing Mahak qrels and we have compared performance of these methods
Event detection from news articles
, Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 981-984 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) ; Sahraei, A ; Abolhassani, H ; Sharif University of Technology
2008
Abstract
In this paper, we propose a new method for automatic news event detection. An event is a specific happening in a particular time and place. We propose a new model in this paper to detect news events using a label based clustering approach. The model takes advantage of the fact that news events are news clusters with high internal similarity whose articles are about an event in a specific time and place. Since news articles about a particular event may appear in several consecutive days, we developed this model to be able to distinguish such events and merge the corresponding news articles. Although event detection is propounded as a stand alone news mining task, it has also applications in...
Mahak: A test collection for evaluation of farsi information retrieval systems
, Article 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, 13 May 2007 through 16 May 2007 ; 2007 , Pages 639-644 ; 1424410312 (ISBN); 9781424410316 (ISBN) ; Abolhassani, H ; Neshati, M ; Behrangi, E ; Rostami, A ; Mohammadi Nasiri, M ; Sharif University of Technology
2007
Abstract
Currently there is no standard test collection for evaluation of Farsi information retrieval systems. In this paper we introduce Mahak, the first complete test collection generally available for evaluating Farsi information retrieval systems. We also discuss our construction process in detail. As a goal, we hope that Mahak will foster the development of Farsi information retrieval systems. © 2007 IEEE
A new evaluation method for ontology alignment measures
, Article 1st Asian Semantic Web Conference, ASWC 2006, Beijing, 3 September 2006 through 7 September 2006 ; Volume 4185 LNCS , 2006 , Pages 249-255 ; 03029743 (ISSN); 3540383298 (ISBN); 9783540383291 (ISBN) ; Abolhassani, H ; Sharif University of Technology
Springer Verlag
2006
Abstract
Various methods using different measures have been proposed for ontology alignment. Therefore, it is necessary to evaluate the effectiveness of such measures to select better ones for more quality alignment. Current approaches for comparing these measures, are highly dependent on alignment frameworks, which may cause unreal results. In this paper, we propose a framework independent evaluation method, and discuss results of applying it to famous existing string measures. © Springer-Verlag Berlin Heidelberg 2006
World city mode choice: Choice of rail public transportation
, Article Scientia Iranica ; Volume 11, Issue 4 , 2004 , Pages 320-331 ; 10263098 (ISSN) ; Tabatabaee, N ; Kermanshah, M ; Aashtiani, H. Z ; Toobaei, S ; Sharif University of Technology
Sharif University of Technology
2004
Abstract
The choice of technology to transport passengers in large metropolitan areas is an important issue everywhere. There are many factors involved in this choice. This paper deals with the possibility of the objective use of available information in the analysis of the suitability of a rail public transport system for a city. A database has been made from publications on public city transportation and country level information. Logit models of choice have been calibrated by the maximum likelihood and nonlinear least square methods based on the acquired information. Each city is treated as an "individual", choosing rail or non-rail modes for its trips. Only cities with a population of more than...
Persian text classification based on topic models
, Article 24th Iranian Conference on Electrical Engineering, ICEE 2016, 10 May 2016 through 12 May 2016 ; 2016 , Pages 86-91 ; 9781467387897 (ISBN) ; Tabandeh, M ; Gholampour, I ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2016
Abstract
With the extensive growth in information, text classification as one of the text mining methods, plays a vital role in organizing and management information. Most text classification methods represent a documents collection as a Bag of Words (BOW) model and then use the histogram of words as the classification features. But in this way, the number of features is very large; therefore performing text classification faces serious computational cost problems. Moreover, the BOW representation is unable to recognize semantic relations between words. Recently, topic-model approaches have been successfully applied for text classification to overcome the problems of BOW. Our main goal in this paper...
-
, Article 2018 Iran Workshop on Communication and Information Theory, IWCIT 2018, 25 April 2018 through 26 April 2018 ; 2018 , Pages 1-6 ; 9781538641491 (ISBN) ; Maddah Ali, M. A ; Sharif University of Technology
Institute of electrical and electronics engineers Inc
2018
Abstract
The widespread use of cloud computing services raises the question of how one can delegate the processing tasks to the untrusted distributed parties without breaching the privacy of its data and algorithms. Motivated by the algorithm privacy concerns in a distributed computing system, in this paper, we introduce the private function retrieval (PFR) problem, where a user wishes to efficiently retrieve a linear function of K messages from N non-communicating replicated servers while keeping the function hidden from each individual server. The goal is to find a scheme with minimum communication cost. To characterize the fundamental limits of the communication cost, we define the capacity of PFR...
Music Emotion Recognition
, M.Sc. Thesis Sharif University of Technology ; Sameti, Hossein (Supervisor)
Abstract
Measuring emotions of music is one of the methods to determine music content. Music emotion detection is applicable in music retrieval, recognition of music genre and also music data management softwares. Music emotion is considered in different sciences such as physiology, psychology, musicology and engineering. First, we collected a database of different types of music with various emotions. These data have been labeled according to their emotions. In this project, four emotions (Angry, happy, relax and sad) have been used as labels based on Thayer’s two dimension emotion model. There are two basic steps for music emotion recognition similar to other recognition systems: Feature extraction...
An Open Domain Question Answering Method Based on Document Categorization
, M.Sc. Thesis Sharif University of Technology ; Abolhassani, Hassan (Supervisor)
Abstract
One of the new paradigms in information retrieval is to develop textual Question-Answering systems. Question-Answering (QA) is an advanced IR process at which for a natural language question, the answer is extracted and issued in natural language. The QA systems are divided into two general groups: Open-Domain QA and Restricted-Domain QA.
In this research field, a number of different models and methods are developed in which a document collection is used to retrieve candidate answers and then different methods are deployed to detect and eliminate irrelevant ones from answer set. Most of these methods decide based on expected semantic answer type, which is determined using pre-defined...
In this research field, a number of different models and methods are developed in which a document collection is used to retrieve candidate answers and then different methods are deployed to detect and eliminate irrelevant ones from answer set. Most of these methods decide based on expected semantic answer type, which is determined using pre-defined...
A Semantic Approach to Web Service Discovery
, M.Sc. Thesis Sharif University of Technology ; Sadighi Moshkenani, Mohsen (Supervisor) ; Safari, Mohammad Ali (Supervisor)
Abstract
Web service technology is becoming increasingly popular since it is very bene?cial in di?erent types of applications. Due to a dramatical increase in the number of developed web services, the service discovery process has become crucial for using web services e?ciently. Service is an adaptive, self-describing, modular application, which may be used in either web or an internal network. Service providers should o?er the services along with a description ?le called advertisement explaining the speci?cations and functionalities of the service. Traditional service discovery methods are based on syntax and keyword matching, which may not satisfy the requester’s desired requirements and will...
Predicting Expert Rank Range In Expert Retrieval
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
Expert retrieval when the number of experts are limited is an open problem. Undoubtedly, becoming an expert in a field is a time consuming and expensive task; thus finding the best candidates is a crucial task. In addition, passage of time and growth of knowledge could change the view of a person towards life and his work, which may lead to the change of his or her field of work. When considering the changes each person makes in his or her life, it becomes obvious that they are not far from the original status. Therefore, recommending all possible options around a person could really help the task of decision making. This research is addressing two similar issues of finding experts, in a...
Music Track Detection Using Audio Fingerprinting
, M.Sc. Thesis Sharif University of Technology ; Sameti, Hossein (Supervisor)
Abstract
Music information reterival systems have a lot of applications in music filtering and broadcast monitoring due to the huge amount of multimedia data these days. In these systems the feature extraction method is called audio fingerprinting. Small size of fingerprints allows the systems to search efficiently in thousands or millions numbers of audio songs. The input signal is usually just a couple of seconds long and degraded in several ways. The goal is to design a system which is robust to signal degradations and efficient to search. In this thesis one of the basic systems is reviewed and improved in several ways. This system uses spectrogram of signals to extract features and build an...
Automatic Temporal Relation Extraction of Persian Texts
, M.Sc. Thesis Sharif University of Technology ; GhassemSani, Gholamreza (Supervisor)
Abstract
Temporal relation extraction is one of the challenging research topics in natural language processing semantic level. The purpose of this kind of extraction is to find the temporal ordering between text events so that they can be used in various applications such as question answering and summarization systems.Most of early researches in temporal relation extractionaimed at finding a number of rules and templates for every single temporal relation in English texts. However, with the availability of temporal corpora in English and some other natural languages like Chinese, Korean, Italian, etc., the research trend in this field turned towards the use of machine learning methods. Accordingly,...
Design and Implementation of a Search Engine for Sample Applications of Object-Oriented Framework-Provided Concepts
, M.Sc. Thesis Sharif University of Technology ; Heydarnoori, Abbas (Supervisor)
Abstract
An object-oriented application framework, like Eclipse, not only provides a framework for designing and implementing new applications, but also decreases the time and the cost of developing new software applications. Moreover, theseframeworks increase the maintainability of software systems. Therefore, their popularity is on the rise. The main problem of using object-oriented application frameworks is the lack of proper documentations and guides. Thus, developers often try to learn how to implement their desired concepts (e.g., Context Menu) from available sample applications. This leads the programmers to another problem which is finding the sample applications. Finding a proper sample...
Temporal Relation Extraction of Persian Texts by Learning Methods
, M.Sc. Thesis Sharif University of Technology ; Ghasem Sani, Gholamreza (Supervisor)
Abstract
To fully understanding a text written in a natural language, we need to comprehend the events within that text. Temporal relation extraction always have been one of the main challenges in natural language processing in semantic level. Temporal relation extraction makes the understanding and interpretation of text easier and the extracted information can be used in many natural language systems like question answering, summarization, and information retrieval systems. Early researches on temporal relation extraction was mainly on English and limited to rule based systems. However, with extending the English corpora and availability of temporal corpora in other languages, more attention has...