Log in

Relevant bibliographies by topics / Large databases / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Large databases.

Dissertations / Theses on the topic 'Large databases'

Author: Grafiati

Published: 4 June 2021

Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Large databases.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

U, Leong-Hou. "Matching problems in large databases." Click to view the E-thesis via HKUTO, 2010. http://sunzi.lib.hku.hk/hkuto/record/B43910488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

U, Leong-Hou, and 余亮豪. "Matching problems in large databases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B43910488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pinheiro, Diogo Ricardo Marques. "Large databases management of space missions." Master's thesis, Universidade de Aveiro, 2012. http://hdl.handle.net/10773/8617.

Full text

Abstract:

Mestrado em Engenharia de Computadores e Telemática<br>A cosmologia é uma área em expansão, sendo realizadas cada vez mais missões espaciais com o objectivo de conhecer melhor o universo, nomeadamente descobrir a sua origem e determinar a sua expansão. Com o avanço da tecnologia, os satélites são equipados com detectores cada vez mais sofisticados, permitindo obter mapas do c eu de elevada resolução. Para facilitar a análise desses dados é necessário recorrer a algumas ferramentas, como por exemplo software que permita representar esses dados graficamente sob a forma de mapas. Devido ao

APA, Harvard, Vancouver, ISO, and other styles

4

Ottesen, Erik Bagge. "Similarity Search in Large Databases using Metric Indexing and Standard Database Access Methods." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9038.

Full text

Abstract:

<p>Several methods exists for performing similarity searches quickly using metric indexing. However, most of these methods are based on main memory indexing or require specialized disk access methods. We have described and implemented a method combining standard database access methods with the LAESA Linear Approximating Eliminating Search Algorithm to perform both range and K nearest neighbour (KNN) queries using standard database access methods and relational operators. We have studied and tested various existing implementations of R-trees, and implemented the R*-tree. We also found that so

APA, Harvard, Vancouver, ISO, and other styles

5

Lee, Sau Dan. "Constrained mining of patterns in large databases." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=978668944.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cary, Ariel. "Scaling Geospatial Searches in Large Spatial Databases." FIU Digital Commons, 2011. http://digitalcommons.fiu.edu/etd/548.

Full text

Abstract:

Modern geographical databases store a rich set of aspatial attributes in addition to geographic data. Retrieving spatial records constrained on spatial and aspatial attributes provides users the ability to perform more interesting spatial analyses via composite spatial searches; e.g., in a real estate database, "Find the nearest homes for sale to my current location that have backyard and whose prices are between $50,000 and $80,000". Efficient processing of such composite searches requires combined indexing strategies of multiple types of data. Existing spatial query engines commonly apply a

APA, Harvard, Vancouver, ISO, and other styles

7

李守敦 and Sau-dan Lee. "Maintenance of association rules in large databases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31215531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Tahir, Shahzaib. "Privacy preserving search in large encrypted databases." Thesis, City, University of London, 2018. http://openaccess.city.ac.uk/21592/.

Full text

Abstract:

The Cloud is an environment designed for the provision of on-demand resource sharing and data access to remotely located clients and devices. Once data is outsourced to the Cloud, clients tend to lose control of their data thus becoming susceptible to data theft. To mitigate/ reduce the chances of data theft, Cloud service providers employ methods like encrypting data prior to outsourcing it to the Cloud. Although this increases security, it also gives rise to the challenge of searching and sifting through the large amounts of encrypted documents present in the Cloud. This thesis proposes a co

APA, Harvard, Vancouver, ISO, and other styles

9

Yuen, Jenny Ph D. Massachusetts Institute of Technology. "Labeling and modeling large databases of videos." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71492.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 91-98).<br>As humans, we can say many things about the scenes surrounding us. For instance, we can tell what type of scene and location an image depicts, describe what objects live in it, their material properties, or their spatial arrangement. These comprise descriptions of a scene and are majorly studied areas in computer vision. This thesis, however, hypotheses that observers have an inherent p

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, Sau-dan. "Maintenance of association rules in large databases /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19003250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Zhang, Ning. "Shortest Path Queries in Very Large Spatial Databases." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1156.

Full text

Abstract:

Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient algorithms have been developed recently for graphs with particular properties such as the weights of edges fall into a range of integer. All of the mentioned algorithms require the graph totally reside in the main memory. Howevery, for very large graphs, such as the digital maps managed by Geogr

APA, Harvard, Vancouver, ISO, and other styles

12

Zhang, Jie. "Optimal Path Queries in Very Large Spatial Databases." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1094.

Full text

Abstract:

Researchers have been investigating the optimal route query problem for a long time. Optimal route queries are categorized as either unconstrained or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra's shortest path algorithm is one of the most popular algorithms for the unconstrained route query problem. The constrained route query problem is more complicated than the unconstrained one, and some constrained route query problems such as the Traveling Salesman Problem and Hamiltonian Path Proble

APA, Harvard, Vancouver, ISO, and other styles

13

Cheng, Shan. "Statistical approaches to predictive modeling in large databases." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq37498.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Wad, Charudatta V. "QoS : quality driven data abstraction for large databases." Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-020508-151213/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Gruhl, Daniel F. "The search for meaning in large text databases." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86423.

Full text

Abstract:

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.<br>Includes bibliographical references (p. 112-115).<br>by Daniel Frederick Gruhl.<br>Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

16

Ng, Tony Chun Tung. "Efficient garbage collection for large object-oriented databases." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/38833.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Halley, Fraser. "Perceptually relevant browsing environments for large texture databases." Thesis, Heriot-Watt University, 2012. http://hdl.handle.net/10399/2562.

Full text

Abstract:

This thesis describes the development of a large database of texture stimuli, the production of a similarity matrix re ecting human judgements of similarity about the database, and the development of three browsing models that exploit structure in the perceptual information for navigation. Rigorous psychophysical comparison experiments are carried out and the SOM (Self Organising Map) found to be the fastest of the three browsing models under examination. We investigate scalable methods of augmenting a similarity matrix using the SOM browsing environment to introduce previously unknown texture

APA, Harvard, Vancouver, ISO, and other styles

18

Hörster, Eva. "Topic models for image retrieval on large-scale databases." kostenfrei kostenfrei, 2009. http://d-nb.info/998079553/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Mesmoudi, Amin. "Declarative parallel query processing on large scale astronomical databases." Thesis, Lyon 1, 2015. http://www.theses.fr/2015LYO10326.

Full text

Abstract:

Les travaux de cette thèse s'inscrivent dans le cadre du projet Petasky. Notre objectif est de proposer des outils permettant de gérer des dizaines de Peta-octets de données issues d'observations astronomiques. Nos travaux se focalisent essentiellement sur la conception des nouveaux systèmes permettant de garantir le passage à l'échelle. Dans cette thèse, nos contributions concernent trois aspects : Benchmarking des systèmes existants, conception d'un nouveau système et optimisation du système. Nous avons commencé par analyser la capacité des systèmes fondés sur le modèle MapReduce et supporta

APA, Harvard, Vancouver, ISO, and other styles

20

Ren, Kan. "System for intuitive interaction with large-scale visual databases." Thesis, University of Surrey, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540707.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Cabal-Yepez, E. "Fast local hardware processing for analysis of large databases." Thesis, University of Sussex, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.436401.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Almuhaidib, Saud M. Y. "User-oriented techniques to support interaction with large databases." Thesis, University of Leeds, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399914.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Palmaro, Aurore. "Measurement of discontinuous drug exposure in large healthcare databases." Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30079/document.

Full text

Abstract:

Le contexte international de la pharmacoépidémiologie, marqué par la mise en œuvre d’un nombre croissant d’études multi-sources, a fait émerger un certain nombre de questionnements autour de la gestion de données conflictuelles ou de l’impact des choix méthodologiques sur les résultats.Accroître la confiance dans ces études observationnelles et renforcer leur crédibilité face aux données issues des essais cliniques représente un enjeu majeur, qui dépend étroitement de la robustesse des conclusions produites. Dans ce domaine, la mesure de l’exposition médicamenteuse revêt donc une importance to

APA, Harvard, Vancouver, ISO, and other styles

24

Yang, Yuping. "Theory and mining of association rules over large databases /." The Ohio State University, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488194825668668.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Sinha, Aman. "Memory management and transaction scheduling for large-scale databases /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Nguyen, Minh Quoc. "Toward accurate and efficient outlier detection in high dimensional and large data sets." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34657.

Full text

Abstract:

An efficient method to compute local density-based outliers in high dimensional data was proposed. In our work, we have shown that this type of outlier is present even in any subset of the dataset. This property is used to partition the data set into random subsets to compute the outliers locally. The outliers are then combined from different subsets. Therefore, the local density-based outliers can be computed efficiently. Another challenge in outlier detection in high dimensional data is that the outliers are often suppressed when the majority of dimensions do not exhibit outliers. The contri

APA, Harvard, Vancouver, ISO, and other styles

27

Hinneburg, Alexander. "Density based clustering in large databases using projections and visualizations." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=967390583.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Guo, Man. "Large imagery handling in relational databases for geospatial information systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0019/MQ48368.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Lam, Lap-Hing Raymond. "Design and analysis of large chemical databases for drug discovery." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ65249.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Linari, Alessandro <1977&gt. "Models and techniques for approximate similarity search in large databases." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/398/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Brown, Christohper Colburn. "Visualising the structure and use of large scale hypermedia databases." Thesis, University of Nottingham, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285678.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Zhou, Zehai 1962. "Data allocation and query optimization in large scale distributed databases." Diss., The University of Arizona, 1996. http://hdl.handle.net/10150/282189.

Full text

Abstract:

Distributed database technology is expected to have a significant impact on data processing in the upcoming years because distributed database systems have many potential advantages over centralized systems for geographically distributed organizations. Data allocation and query optimization are two of the most important aspects of distributed database design. Data allocation involves placing a database and the applications that run against it in the multiple sites of a network. It is a very complex problem consisting of two processes: data fragmentation and fragment allocation. Data fragmentat

APA, Harvard, Vancouver, ISO, and other styles

33

FABRIS, F. "A Novel Cooperative Algorithm for Clustering Large Databases With Sampling." Universidade Federal do Espírito Santo, 2012. http://repositorio.ufes.br/handle/10/4256.

Full text

Abstract:

Made available in DSpace on 2016-08-29T15:33:17Z (GMT). No. of bitstreams: 1 tese_5121_.pdf: 735975 bytes, checksum: aeffd7d6fc81e4f73c1f18fb633dc4e1 (MD5) Previous issue date: 2012-07-30<br>Agrupamento de dados é uma tarefa recorrente em mineração de dados. Com o passar do tempo, vem se tornando mais importante o agrupamento de bases cada vez maiores. Contudo, aplicar heurísticas de agrupamento tradicionais em grandes bases não é uma tarefa fácil. Essas técnicas geralmente possuem complexidades pelo menos quadráticas no número de pontos da base, tornando o seu uso inviável pelo alto tempo d

APA, Harvard, Vancouver, ISO, and other styles

34

Obalappa, Dinesh Tretiak Oleh J. "Optimal caching of large multi-dimensional datasets /." Philadelphia, Pa. : Drexel University, 2004. http://dspace.library.drexel.edu/handle/1860/307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Layer, Christophe. "A coprocessor for fast searching in large databases: Associative Computing Engine." [S.l. : s.n.], 2007. http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-60254.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Mehta, Nishant K. "A Hierarchy Navigation Framework: Supporting Scalable Interactive Exploration over Large Databases." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0827104-114148/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Wang, C. J. "The Lexical Token Converter : Hardware support for Large Knowledge Based Systems." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.383888.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Savasere, Ashok. "Efficient algorithms for mining association rules in large databases of cutomer transactions." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/8260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bechchi, Mounir. "Clustering-based Approximate Answering of Query Result in Large and Distributed Databases." Phd thesis, Université de Nantes, 2009. http://tel.archives-ouvertes.fr/tel-00475917.

Full text

Abstract:

Les utilisateurs des bases de données doivent faire face au problème de surcharge d'information lors de l'interrogation de leurs données, qui se traduit par un nombre de réponses trop élevé à des requêtes exploratoires. Pour remédier à ce problème, nous proposons un algorithme efficace et rapide, ap- pelé ESRA (Explore-Select-Rearrange Algorithm), qui utilise les résumés SAINTETIQ pré-calculés sur l'ensemble des données pour regrouper les réponses à une requête utilisateur en un ensemble de classes (ou résumés) organisées hiérarchiquement. Chaque classe décrit un sous-ensemble de résul- tats d

APA, Harvard, Vancouver, ISO, and other styles

40

Kaneva, Biliana K. "Large databases of real and synthetic images for feature evaluation and prediction." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71478.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 157-167).<br>Image features are widely used in computer vision applications from stereo matching to panorama stitching to object and scene recognition. They exploit image regularities to capture structure in images both locally, using a patch around an interest point, and globally, over the entire image. Image features need to be distinctive and robust toward variations in scene content, camera vi

APA, Harvard, Vancouver, ISO, and other styles

41

Nigrin, Daniel J. (Daniel Joseph) 1965. "Improved access to large medical databases for clinical research and quality improvement." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/9740.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Whitaker College of Health Sciences and Technology, 1999.<br>Includes bibliographical references (leaves 39-40).<br>Computerized medical databases are now commonplace in healthcare environments. Information is routinely stored for each clinical encounter, be it an inpatient, outpatient, telephone, or even computer-based interaction. In the past, the vast majority of this data concerned the demographic and financial details of the encounter; however, more and more clinically relevant content is now being collected. Along with this increased

APA, Harvard, Vancouver, ISO, and other styles

42

He, Hai. "Towards automatic understanding and integration of web databases for developing large-scale unified access systems." Diss., Online access via UMI:, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Roma, Trepat Gerard. "Algorithms and representations for supporting online music creation with large-scale audio databases." Doctoral thesis, Universitat Pompeu Fabra, 2015. http://hdl.handle.net/10803/297428.

Full text

Abstract:

The rapid adoption of Internet and web technologies has created an opportunity for making music collaboratively by sharing information online. However, current applications for online music making do not take advantage of the potential of shared information. The goal of this dissertation is to provide and evaluate algorithms and representations for interacting with large audio databases that facilitate music creation by online communities. This work has been developed in the context of Freesound, a large-scale, community-driven database of audio recordings shared under Creative Commons (CC) li

APA, Harvard, Vancouver, ISO, and other styles

44

Cheema, Muhammad Shahzad [Verfasser]. "Efficient Human Activity Recognition in Large Image and Video Databases / Muhammad Shahzad Cheema." Bonn : Universitäts- und Landesbibliothek Bonn, 2014. http://d-nb.info/1060787385/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Tang, Gary L. "Fuzzy inference systems for iris biometrics to reduce search time in large databases." Scholarly Commons, 2014. https://scholarlycommons.pacific.edu/uop_etds/230.

Full text

Abstract:

This research attempts to use a method that can reduce the search time of a system trying to match a user's iris image against those in a very large database. One method to reduce search time is to predict an individual's ethnicity and then only search iris templates belonging to that particular ethnicity in the database. By limiting the search to a small subsection of the database, as opposed to an exhaustive search, this method will cut significant run time from the search process. We propose the use of an adaptive neuro-fuzzy inference system to implement this idea. In addition to the adapt

APA, Harvard, Vancouver, ISO, and other styles

46

Samoladas, Vasilis. "On indexing large databases for advanced data models." 2001. http://hdl.handle.net/2152/10823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

顏秀珍. "Efficient knowledge discovery from large databases." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/72994927830845816890.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

"Query and mining in large graph databases." 2013. http://library.cuhk.edu.hk/record=b5549792.

Full text

Abstract:

图结构能够描述数据对象之间的复杂关系，因而被广泛应用于多种领域。随着相关应用领域的发展，图数据库的规模变得庞大且仍在不断增长。这给研究者在图查询和图挖掘方面带来新的挑战。本文主要研究以下三个问题：如何确定两个图的顶点对应关系，使得其中一个图的子结构匹配到另一个图的相似子结构；如何从含有多个小图的数据库中，找到与查询图相似的图；如何在由不同类别的图组成的数据库中，选取特征子图并对图进行分类。<br>在本文中，对于第一个问题，我们提出了新的两段式图匹配算法。在第一阶段，我们采用了一个新的启发式策略，能够先选取锚顶点并向外扩展，进而快速得到初始匹配。在第二阶段，我们设计了新的算法对初始匹配加以改进，并且证明了新的匹配优于初始匹配。这个两段式图匹配算法能够快速有效地获得两个图的高质量匹配。为解决第二个问题，我们首先定义一个新的度量以衡量两图间的距离。它基于两图间的最大公共子图，能够很好地捕捉两个图的相同及不同之处。由于最大公共子图的计算是NP完全问题，为了快速回答top-k相似图查询，我们提出了一个高效算法，能够极大地减少最大公共子图的计算次数。这个算法根据距离度量的三种下界进行剪枝以筛选掉不合格的图。其中，前两种下界的计算基于两图的结构信息，第三种下界可由距离度量的三角不等式性质推出。我们还设计了三种不同的索引结构来支持剪枝，它们能够在剪枝效果和索引时间方面达到不同程度的平衡。关于第三个

APA, Harvard, Vancouver, ISO, and other styles

49

Shu-Chen, Chang, and 張淑貞. "Mining Multilevel Association Rules in Large Databases." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/62587213281806320843.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>資訊管理系<br>89<br>As a useful business intelligence tool, data mining is gaining its popularity in many real life applications. Association rules is an important data mining technique developed for looking for the relationship among items bought by customers in a supermarket. To increase its applicability, some researchers have worked on mining association rules from relational databases. Mining association rules from relational databases is much more difficult than mining association rules from transactional databases, especially when numerical attributes are involved. This pro

APA, Harvard, Vancouver, ISO, and other styles

50

Krovetz, Robert Jeffrey. "Word-sense disambiguation for large text databases." 1995. https://scholarworks.umass.edu/dissertations/AAI9541123.

Full text

Abstract:

Most retrieval systems represent documents and queries by the words they contain, and rank documents based on the words in common with the query. Because words are ambiguous, this can cause documents to be retrieved that are not relevant. In addition, a document can be relevant even if it does not mention the exact words used in the query. A user is generally not interested in the words, but in the concepts that those words represent. We report on an analysis of lexical ambiguity in information retrieval test collections, and on experiments to determine the utility of word meanings for separat

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!