-
Blank, I.; Rokach, L.; Shani, G.: Leveraging metadata to recommend keywords for academic papers (2016)
0.02
0.015969018 = product of:
0.06387607 = sum of:
0.06387607 = weight(_text_:engines in 3232) [ClassicSimilarity], result of:
0.06387607 = score(doc=3232,freq=2.0), product of:
0.22757743 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.04479146 = queryNorm
0.2806784 = fieldWeight in 3232, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0390625 = fieldNorm(doc=3232)
0.25 = coord(1/4)
- Abstract
- Users of research databases, such as CiteSeerX, Google Scholar, and Microsoft Academic, often search for papers using a set of keywords. Unfortunately, many authors avoid listing sufficient keywords for their papers. As such, these applications may need to automatically associate good descriptive keywords with papers. When the full text of the paper is available this problem has been thoroughly studied. In many cases, however, due to copyright limitations, research databases do not have access to the full text. On the other hand, such databases typically maintain metadata, such as the title and abstract and the citation network of each paper. In this paper we study the problem of predicting which keywords are appropriate for a research paper, using different methods based on the citation network and available metadata. Our main goal is in providing search engines with the ability to extract keywords from the available metadata. However, our system can also be used for other applications, such as for recommending keywords for the authors of new papers. We create a data set of research papers, and their citation network, keywords, and other metadata, containing over 470K papers with and more than 2 million keywords. We compare our methods with predicting keywords using the title and abstract, in offline experiments and in a user study, concluding that the citation network provides much better predictions.
-
Martins, E.F.; Belém, F.M.; Almeida, J.M.; Gonçalves, M.A.: On cold start for associative tag recommendation (2016)
0.01
0.013290926 = product of:
0.053163704 = sum of:
0.053163704 = product of:
0.10632741 = sum of:
0.10632741 = weight(_text_:programming in 2494) [ClassicSimilarity], result of:
0.10632741 = score(doc=2494,freq=2.0), product of:
0.29361802 = queryWeight, product of:
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.04479146 = queryNorm
0.36212835 = fieldWeight in 2494, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.5552235 = idf(docFreq=170, maxDocs=44218)
0.0390625 = fieldNorm(doc=2494)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Tag recommendation strategies that exploit term co-occurrence patterns with tags previously assigned to the target object have consistently produced state-of-the-art results. However, such techniques work only for objects with previously assigned tags. Here we focus on tag recommendation for objects with no tags, a variation of the well-known \textit{cold start} problem. We start by evaluating state-of-the-art co-occurrence based methods in cold start. Our results show that the effectiveness of these methods suffers in this situation. Moreover, we show that employing various automatic filtering strategies to generate an initial tag set that enables the use of co-occurrence patterns produces only marginal improvements. We then propose a new approach that exploits both positive and negative user feedback to iteratively select input tags along with a genetic programming strategy to learn the recommendation function. Our experimental results indicate that extending the methods to include user relevance feedback leads to gains in precision of up to 58% over the best baseline in cold start scenarios and gains of up to 43% over the best baseline in objects that contain some initial tags (i.e., no cold start). We also show that our best relevance-feedback-driven strategy performs well even in scenarios that lack user cooperation (i.e., users may refuse to provide feedback) and user reliability (i.e., users may provide the wrong feedback).
-
Kajanan, S.; Bao, Y.; Datta, A.; VanderMeer, D.; Dutta, K.: Efficient automatic search query formulation using phrase-level analysis (2014)
0.01
0.012775214 = product of:
0.051100858 = sum of:
0.051100858 = weight(_text_:engines in 1264) [ClassicSimilarity], result of:
0.051100858 = score(doc=1264,freq=2.0), product of:
0.22757743 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.04479146 = queryNorm
0.22454272 = fieldWeight in 1264, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.03125 = fieldNorm(doc=1264)
0.25 = coord(1/4)
- Abstract
- Over the past decade, the volume of information available digitally over the Internet has grown enormously. Technical developments in the area of search, such as Google's Page Rank algorithm, have proved so good at serving relevant results that Internet search has become integrated into daily human activity. One can endlessly explore topics of interest simply by querying and reading through the resulting links. Yet, although search engines are well known for providing relevant results based on users' queries, users do not always receive the results they are looking for. Google's Director of Research describes clickstream evidence of frustrated users repeatedly reformulating queries and searching through page after page of results. Given the general quality of search engine results, one must consider the possibility that the frustrated user's query is not effective; that is, it does not describe the essence of the user's interest. Indeed, extensive research into human search behavior has found that humans are not very effective at formulating good search queries that describe what they are interested in. Ideally, the user should simply point to a portion of text that sparked the user's interest, and a system should automatically formulate a search query that captures the essence of the text. In this paper, we describe an implemented system that provides this capability. We first describe how our work differs from existing work in automatic query formulation, and propose a new method for improved quantification of the relevance of candidate search terms drawn from input text using phrase-level analysis. We then propose an implementable method designed to provide relevant queries based on a user's text input. We demonstrate the quality of our results and performance of our system through experimental studies. Our results demonstrate that our system produces relevant search terms with roughly two-thirds precision and recall compared to search terms selected by experts, and that typical users find significantly more relevant results (31% more relevant) more quickly (64% faster) using our system than self-formulated search queries. Further, we show that our implementation can scale to request loads of up to 10 requests per second within current online responsiveness expectations (<2-second response times at the highest loads tested).
-
Hauer, M.: Tiefenindexierung im Bibliothekskatalog : 17 Jahre intelligentCAPTURE (2019)
0.01
0.009102937 = product of:
0.036411747 = sum of:
0.036411747 = product of:
0.072823495 = sum of:
0.072823495 = weight(_text_:22 in 5629) [ClassicSimilarity], result of:
0.072823495 = score(doc=5629,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.46428138 = fieldWeight in 5629, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=5629)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- B.I.T.online. 22(2019) H.2, S.163-166
-
Markoff, J.: Researchers announce advance in image-recognition software (2014)
0.01
0.007984509 = product of:
0.031938035 = sum of:
0.031938035 = weight(_text_:engines in 1875) [ClassicSimilarity], result of:
0.031938035 = score(doc=1875,freq=2.0), product of:
0.22757743 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.04479146 = queryNorm
0.1403392 = fieldWeight in 1875, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.01953125 = fieldNorm(doc=1875)
0.25 = coord(1/4)
- Content
- "Until now, so-called computer vision has largely been limited to recognizing individual objects. The new software, described on Monday by researchers at Google and at Stanford University, teaches itself to identify entire scenes: a group of young men playing Frisbee, for example, or a herd of elephants marching on a grassy plain. The software then writes a caption in English describing the picture. Compared with human observations, the researchers found, the computer-written descriptions are surprisingly accurate. The advances may make it possible to better catalog and search for the billions of images and hours of video available online, which are often poorly described and archived. At the moment, search engines like Google rely largely on written language accompanying an image or video to ascertain what it contains. "I consider the pixel data in images and video to be the dark matter of the Internet," said Fei-Fei Li, director of the Stanford Artificial Intelligence Laboratory, who led the research with Andrej Karpathy, a graduate student. "We are now starting to illuminate it." Dr. Li and Mr. Karpathy published their research as a Stanford University technical report. The Google team published their paper on arXiv.org, an open source site hosted by Cornell University.
-
Stankovic, R. et al.: Indexing of textual databases based on lexical resources : a case study for Serbian (2016)
0.01
0.007585781 = product of:
0.030343125 = sum of:
0.030343125 = product of:
0.06068625 = sum of:
0.06068625 = weight(_text_:22 in 2759) [ClassicSimilarity], result of:
0.06068625 = score(doc=2759,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.38690117 = fieldWeight in 2759, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=2759)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 1. 2.2016 18:25:22
-
Glaesener, L.: Automatisches Indexieren einer informationswissenschaftlichen Datenbank mit Mehrwortgruppen (2012)
0.01
0.0060686246 = product of:
0.024274498 = sum of:
0.024274498 = product of:
0.048548996 = sum of:
0.048548996 = weight(_text_:22 in 401) [ClassicSimilarity], result of:
0.048548996 = score(doc=401,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.30952093 = fieldWeight in 401, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=401)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 11. 9.2012 19:43:22
-
Kasprzik, A.: Voraussetzungen und Anwendungspotentiale einer präzisen Sacherschließung aus Sicht der Wissenschaft (2018)
0.01
0.0053100465 = product of:
0.021240186 = sum of:
0.021240186 = product of:
0.042480372 = sum of:
0.042480372 = weight(_text_:22 in 5195) [ClassicSimilarity], result of:
0.042480372 = score(doc=5195,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.2708308 = fieldWeight in 5195, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5195)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Große Aufmerksamkeit richtet sich im Moment auf das Potential von automatisierten Methoden in der Sacherschließung und deren Interaktionsmöglichkeiten mit intellektuellen Methoden. In diesem Kontext befasst sich der vorliegende Beitrag mit den folgenden Fragen: Was sind die Anforderungen an bibliothekarische Metadaten aus Sicht der Wissenschaft? Was wird gebraucht, um den Informationsbedarf der Fachcommunities zu bedienen? Und was bedeutet das entsprechend für die Automatisierung der Metadatenerstellung und -pflege? Dieser Beitrag fasst die von der Autorin eingenommene Position in einem Impulsvortrag und der Podiumsdiskussion beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
-
Franke-Maier, M.: Anforderungen an die Qualität der Inhaltserschließung im Spannungsfeld von intellektuell und automatisch erzeugten Metadaten (2018)
0.01
0.0053100465 = product of:
0.021240186 = sum of:
0.021240186 = product of:
0.042480372 = sum of:
0.042480372 = weight(_text_:22 in 5344) [ClassicSimilarity], result of:
0.042480372 = score(doc=5344,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.2708308 = fieldWeight in 5344, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5344)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Spätestens seit dem Deutschen Bibliothekartag 2018 hat sich die Diskussion zu den automatischen Verfahren der Inhaltserschließung der Deutschen Nationalbibliothek von einer politisch geführten Diskussion in eine Qualitätsdiskussion verwandelt. Der folgende Beitrag beschäftigt sich mit Fragen der Qualität von Inhaltserschließung in digitalen Zeiten, wo heterogene Erzeugnisse unterschiedlicher Verfahren aufeinandertreffen und versucht, wichtige Anforderungen an Qualität zu definieren. Dieser Tagungsbeitrag fasst die vom Autor als Impulse vorgetragenen Ideen beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV am 29. August 2018 in Kiel zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
-
Busch, D.: Domänenspezifische hybride automatische Indexierung von bibliographischen Metadaten (2019)
0.00
0.0045514684 = product of:
0.018205874 = sum of:
0.018205874 = product of:
0.036411747 = sum of:
0.036411747 = weight(_text_:22 in 5628) [ClassicSimilarity], result of:
0.036411747 = score(doc=5628,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.23214069 = fieldWeight in 5628, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=5628)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- B.I.T.online. 22(2019) H.6, S.465-469
-
Junger, U.; Schwens, U.: ¬Die inhaltliche Erschließung des schriftlichen kulturellen Erbes auf dem Weg in die Zukunft : Automatische Vergabe von Schlagwörtern in der Deutschen Nationalbibliothek (2017)
0.00
0.0037928906 = product of:
0.015171562 = sum of:
0.015171562 = product of:
0.030343125 = sum of:
0.030343125 = weight(_text_:22 in 3780) [ClassicSimilarity], result of:
0.030343125 = score(doc=3780,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.19345059 = fieldWeight in 3780, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=3780)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 19. 8.2017 9:24:22
-
Martins, A.L.; Souza, R.R.; Ribeiro de Mello, H.: ¬The use of noun phrases in information retrieval : proposing a mechanism for automatic classification (2014)
0.00
0.0030343123 = product of:
0.012137249 = sum of:
0.012137249 = product of:
0.024274498 = sum of:
0.024274498 = weight(_text_:22 in 1441) [ClassicSimilarity], result of:
0.024274498 = score(doc=1441,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.15476047 = fieldWeight in 1441, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=1441)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik
-
Mesquita, L.A.P.; Souza, R.R.; Baracho Porto, R.M.A.: Noun phrases in automatic indexing: : a structural analysis of the distribution of relevant terms in doctoral theses (2014)
0.00
0.0030343123 = product of:
0.012137249 = sum of:
0.012137249 = product of:
0.024274498 = sum of:
0.024274498 = weight(_text_:22 in 1442) [ClassicSimilarity], result of:
0.024274498 = score(doc=1442,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.15476047 = fieldWeight in 1442, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=1442)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik
-
Greiner-Petter, A.; Schubotz, M.; Cohl, H.S.; Gipp, B.: Semantic preserving bijective mappings for expressions involving special functions between computer algebra systems and document preparation systems (2019)
0.00
0.0030343123 = product of:
0.012137249 = sum of:
0.012137249 = product of:
0.024274498 = sum of:
0.024274498 = weight(_text_:22 in 5499) [ClassicSimilarity], result of:
0.024274498 = score(doc=5499,freq=2.0), product of:
0.15685207 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04479146 = queryNorm
0.15476047 = fieldWeight in 5499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=5499)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 20. 1.2015 18:30:22
