Sökning: "solr"
Visar resultat 11 - 15 av 16 uppsatser innehållade ordet solr.
11. Dynamic Query Completion Through Search Result Clustering
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Query completion is a feature employed by most modernsearch engines. These completions can be derived by different means. The most popular algorithm ranks completions by the frequency with which it appears in a database of old query logs. LÄS MER
12. Intelligent Retrieval and Clustering of Inventions
Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)Sammanfattning : Ericsson’s Region IPR & Licensing (RIPL) receives about 3000 thousands Invention Disclosures (IvDs) every year submitted by researchers as a result of their R&D activities. To decide whether an IvD has a good business value and a patent application should be filed; a rigorous evaluation process is carried out by a selected Patent Attorney (PA). LÄS MER
13. Grammar-based suggestion engine with keyword search
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : In this thesis we investigate how we can develop an application which can translate sentences formulated in natural languages (English and Swedish) into a query language. We also build a suggestion engine which offers suggestions to a user based on a partial or invalid sentence. LÄS MER
14. Changing a user’s search experience byincorporating preferences of metadata
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Implicit feedback is usually data that comes from users’ clicks, search queries and text highlights. It exists in abun- dance, but it is riddled with much noise and requires advanced algorithms to properly make good use of it. LÄS MER
15. Adaptiv relevansmodell med betingadsannolikhetshierarki
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Syftet med detta examensarbete är att implementera en adaptiv relevansmodell för att kunna analysera hur bra denna presterar med den lilla mängd träningsdata som finns tillgänglig. Resultatet bygger på den betingade sannolikhetshierarki som är framtagen av Zhou et al. LÄS MER