SWM '17最新文献

筛选
英文 中文
Describing Data Processing Pipelines in Scientific Publications for Big Data Injection 面向大数据注入的科学出版物数据处理管道描述
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057149
S. Mesbah, A. Bozzon, C. Lofi, G. Houben
{"title":"Describing Data Processing Pipelines in Scientific Publications for Big Data Injection","authors":"S. Mesbah, A. Bozzon, C. Lofi, G. Houben","doi":"10.1145/3057148.3057149","DOIUrl":"https://doi.org/10.1145/3057148.3057149","url":null,"abstract":"The rise of Big Data analytics has been a disruptive game changer for many application domains, allowing the integration into domain-specific applications and systems of insights and knowledge extracted from external big data sets. The effective \"injection\" of external Big Data demands an understanding of the properties of available data sets, and expertise on the available and most suitable methods for data collection, enrichment and analysis. A prominent knowledge source is scientific literature, where data processing pipelines are described, discussed, and evaluated. Such knowledge is however not readily accessible, due to its distributed and unstructured nature. In this paper, we propose a novel ontology aimed at modeling properties of data processing pipelines, and their related artifacts, as described in scientific publications. The ontology is the result of a requirement analysis that involved experts from both academia and industry. We showcase the effectiveness of our ontology by manually applying it to a collection of publications describing data processing methods.","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122016540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Scalable Algorithm for Probabilistic Overlapping Community Detection 概率重叠社区检测的可扩展算法
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057150
Kento Nozawa, Kei Wakabayashi
{"title":"Scalable Algorithm for Probabilistic Overlapping Community Detection","authors":"Kento Nozawa, Kei Wakabayashi","doi":"10.1145/3057148.3057150","DOIUrl":"https://doi.org/10.1145/3057148.3057150","url":null,"abstract":"In the data mining field, community detection, which decomposes a graph into multiple subgraphs, is one of the major techniques to analyze graph data. In recent years, the scalability of the community detection algorithm has been a crucial issue because of the growing size of real-world networks such as the co-author network and web graph. In this paper, we propose a scalable overlapping community detection method by using the stochastic variational Bayesian training of latent Dirichlet allocation (LDA) models, which predicts sets of neighbor nodes with a community mixture distribution. In the experiment, we show that the proposed method is much faster than previous methods and is capable of detecting communities even in a huge network that contains 60 million nodes and 1.8 billion edges. Furthermore, we compared different mini-batch sizes and the number of iterations in stochastic variational Bayesian inference to determine an empirical trade-off between efficiency and quality of overlapping community detection.","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117322401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Citations and Readership are Poor Indicators of Research Excellence: Introducing TrueImpactDataset, a New Dataset for Validating Research Evaluation Metrics 引用和读者是研究卓越性的不良指标:介绍TrueImpactDataset,一个验证研究评估指标的新数据集
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057154
Drahomira Herrmannova, R. Patton, Petr Knoth, Christopher G. Stahl
{"title":"Citations and Readership are Poor Indicators of Research Excellence: Introducing TrueImpactDataset, a New Dataset for Validating Research Evaluation Metrics","authors":"Drahomira Herrmannova, R. Patton, Petr Knoth, Christopher G. Stahl","doi":"10.1145/3057148.3057154","DOIUrl":"https://doi.org/10.1145/3057148.3057154","url":null,"abstract":"In this paper we show that citation counts and Mendeley readership are poor indicators of research excellence. Our experimental design builds on the assumption that a good evaluation metric should be able to distinguish publications that have changed a research field from those that have not. The experiment has been conducted on a new dataset for bibliometric research which we call TrueImpactDataset. TrueImpactDataset is a collection of research publications of two types -- research papers which are considered seminal work in their area and papers which provide a survey (a literature review) of a research area. The dataset also contains related metadata, which include DOIs, titles, authors and abstracts. We describe how the dataset was built and provide overview statistics of the dataset. We propose to use the dataset for validating research evaluation metrics. By using this data, we show that widely used research metrics only poorly distinguish excellent research.","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124080003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
ScholarBase: Towards a Cross-Domain Knowledgebase for Linked Scholarly Data ScholarBase:面向链接学术数据的跨领域知识库
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057153
Mahmoud Elbattah
{"title":"ScholarBase: Towards a Cross-Domain Knowledgebase for Linked Scholarly Data","authors":"Mahmoud Elbattah","doi":"10.1145/3057148.3057153","DOIUrl":"https://doi.org/10.1145/3057148.3057153","url":null,"abstract":"Linked Data has gained a significant momentum over the last years through various initiatives embraced by academia and industry as well. In this paper, we introduce ScholarBase, a research project in progress that is aimed to serve as a Linked Data repository for cross-domain scholarly data. ScholarBase can be conceived as a knowledgebase that weaves links among scholars, institutions, research areas, publications, and geographical locations in a Linked Data fashion. Initially, the primary source of data stems from Google Scholar, specifically the profile pages of scholars. Subsequently, the collected dataset is transformed into a semantic-based format (i.e. RDF). The semantified dataset will enable a machine-readable expression of entity relationships, and can in turn be linked to external knowledge bases (e.g. DBpedia). Through the paper, we discuss the architecture and implementation of the project. ScholarBase can play an important role in the Linked Data web by opening extended opportunities for interesting applications, and data exploration of scholarly data.","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121430061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Building recommender systems for scholarly information 建立学术信息推荐系统
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057152
Maya Hristakeva, Daniel James Kershaw, Marco Rossetti, Petr Knoth, Benjamin Pettit, S. Vargas, Kris Jack
{"title":"Building recommender systems for scholarly information","authors":"Maya Hristakeva, Daniel James Kershaw, Marco Rossetti, Petr Knoth, Benjamin Pettit, S. Vargas, Kris Jack","doi":"10.1145/3057148.3057152","DOIUrl":"https://doi.org/10.1145/3057148.3057152","url":null,"abstract":"The depth and breadth of research now being published is overwhelming for an individual researcher to keep track of let alone consume. Recommender systems have been developed to make it easier for researchers to discover relevant content. However, these have predominately taken the form of item-to-item recommendations using citation network features or text similarity features.\u0000 This paper details how the Mendeley Suggest recommender system has been designed and developed. We show how implicit user feedback (based on activity data from the reference manager) and collaborative filtering (CF) are used to generate the recommendations for Mendeley Suggest. Because collaborative filtering suffers from the cold start problem (the inability to serve recommendations to new users), we developed additional recommendation methods based on user-defined attributes, such as discipline and research interests.\u0000 Our off-line evaluation shows that where possible, recommendations based on collaborative filtering perform best, followed by recommendations based on recent activity. However, for cold users (for whom collaborative filtering was not possible) recommendations based on discipline performed best. Additionally, when we segmented users by career stages, we found that among senior academics, content-based recommendations from recent activity had comparable performance to collaborative filtering. This justifies our approach of developing a variety of recommendation methods, in order to serve a range of users across the academic spectrum.","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123434919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Effectively identifying users' research interests for scholarly reference management and discovery 有效识别用户的研究兴趣,进行学术参考资料管理和发现
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057151
Marco Rossetti, S. Vargas, Davide Magatti, Benjamin Pettit, Daniel James Kershaw, Maya Hristakeva, Kris Jack
{"title":"Effectively identifying users' research interests for scholarly reference management and discovery","authors":"Marco Rossetti, S. Vargas, Davide Magatti, Benjamin Pettit, Daniel James Kershaw, Maya Hristakeva, Kris Jack","doi":"10.1145/3057148.3057151","DOIUrl":"https://doi.org/10.1145/3057148.3057151","url":null,"abstract":"Discovering users' interests is essential in order to help them explore resources in large digital repositories. In particular, correctly identifying users' interests is commonly a good approach for organising information and providing personalised recommendations. We consider here the case of discovering users' research interests in Mendeley a research platform for scholarly article management and discovery. Prior work in this area has considered approaches such as matrix factorisation and text-based topic modelling for inferring topics of interest in recommendation scenarios. These approaches present several problems, such as little or no interpretability of the inferred topics and difficulty handling similarities in vocabulary in different research disciplines. We present an effective solution for extracting coherent and interpretable research topics that leverages the reference management data in Mendeley in a three-step approach: 1) a topic model based on the interactions between users and articles rather than article content, 2) keyword extraction to label the topics using article titles and author-declared keywords and 3) identifying the research interests of users based on the articles that they have added to their libraries. An evaluation comprised of a research interest prediction task and an article recommendation task shows the validity of our proposal in different research disciplines (clearly outperforming a text-based latent topic model) and provides further insights regarding the effects of number of latent topics in the model and the trade-off between recency and quantity of the users' libraries.","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125863259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Linking Mathematical Expressions to Wikipedia 链接数学表达式到维基百科
SWM '17 Pub Date : 2017-02-10 DOI: 10.1145/3057148.3057156
Giovanni Yoko Kristianto, Akiko Aizawa
{"title":"Linking Mathematical Expressions to Wikipedia","authors":"Giovanni Yoko Kristianto, Akiko Aizawa","doi":"10.1145/3057148.3057156","DOIUrl":"https://doi.org/10.1145/3057148.3057156","url":null,"abstract":"This paper addresses the challenge of determining the identity of mathematical expressions in documents by linking these expressions to their corresponding Wikipedia articles. Math expressions are frequently used to describe important concepts in scientific documents; however, particularly in the case of famous or well-established equations, they are often minimally explained within the documents themselves. Linking to Wikipedia allows readers to obtain additional explanation of these math expressions. This paper proposes a learning-based approach to solve this challenge using common features, such as math and text similarities, as well as the importance of the math expression within the document. Further, we develop a dataset that allowed us to train and test our proposed approach. Experimental results show that our learning-based approach achieves a precision of 83.40%, compared with 6.22% for the baseline method (a straightforward application of MathIR).","PeriodicalId":338752,"journal":{"name":"SWM '17","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124717714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书