首页 > 最新文献

Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web最新文献

英文 中文
Generating Context Acquisition Code using Awareness API 使用感知API生成上下文获取代码
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3131586
P. A. S. Duarte, Maria J. P. Peixoto, Yuri S. F. Frota, Windson Viana
Development of Context-Aware and Mobile applications have significant challenges, such as the complexity of sensor access code and the heterogeneity of devices. The Google Awareness API is an initiative to mitigate this complexity. This paper presents an analysis of GitHub projects involving Awareness API. However, the results showed that the spread of this API among the developers community is still incipient. We propose to extend a tool to allow high-level modeling of context acquisition and code generation compatible with Awareness API. It reduces the complexity of acquiring contextual information and managing contextual rules.
上下文感知和移动应用程序的开发面临着重大挑战,例如传感器访问代码的复杂性和设备的异质性。Google Awareness API是缓解这种复杂性的一个创举。本文对涉及Awareness API的GitHub项目进行了分析。然而,结果表明,该API在开发人员社区中的传播仍处于初期阶段。我们建议扩展一个工具,以允许上下文获取的高级建模和与Awareness API兼容的代码生成。它降低了获取上下文信息和管理上下文规则的复杂性。
{"title":"Generating Context Acquisition Code using Awareness API","authors":"P. A. S. Duarte, Maria J. P. Peixoto, Yuri S. F. Frota, Windson Viana","doi":"10.1145/3126858.3131586","DOIUrl":"https://doi.org/10.1145/3126858.3131586","url":null,"abstract":"Development of Context-Aware and Mobile applications have significant challenges, such as the complexity of sensor access code and the heterogeneity of devices. The Google Awareness API is an initiative to mitigate this complexity. This paper presents an analysis of GitHub projects involving Awareness API. However, the results showed that the spread of this API among the developers community is still incipient. We propose to extend a tool to allow high-level modeling of context acquisition and code generation compatible with Awareness API. It reduces the complexity of acquiring contextual information and managing contextual rules.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128625505","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
Extracting Bus Lines Services Information from GPS Registries 从GPS注册表中提取公交线路服务信息
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3126881
Daniel P. T. Dantas, Antonio A. Rocha, Marcos Lage
The efficiency of urban mobility is a huge concern of urban population around the world. Because of this reason, city planners spend much of their time monitoring transportations systems and designing solutions in order to improve the system's quality. Among these solutions, the most successful ones are computational tools called Intelligent Transportation Systems (ITS). The success of ITS has encouraged public agencies, owners of the public transportation system information, to share their datasets with the population aiming to stimulate the development of new research and solutions that could help to improve urban mobility. Taking advantage of this trend, this work uses the Rio de Janeiro buses GPS logs dataset to extract some of the main operational information about the city bus system. More specifically, garage locations, start and end points of a route, and the route (the complete sequence of streets) of a bus line are inferred.This information is extremely important for both city planners and population since administrators can benefit from it to better plan the transportation system and the population can become more informed about the system, what improves its reliability and overall usage satisfaction.
城市交通效率是全球城市人口关注的一大问题。由于这个原因,城市规划者花费大量时间监控交通系统和设计解决方案,以提高系统的质量。在这些解决方案中,最成功的是被称为智能交通系统(ITS)的计算工具。ITS的成功鼓励公共机构,公共交通系统信息的所有者,与公众分享他们的数据集,旨在刺激新的研究和解决方案的发展,有助于改善城市交通。利用这一趋势,本工作使用里约热内卢公交GPS日志数据集提取有关城市公交系统的一些主要运营信息。更具体地说,可以推断出车库位置、路线的起点和终点,以及公交线路的路线(街道的完整序列)。这些信息对城市规划者和居民都非常重要,因为管理者可以从中受益,更好地规划交通系统,人们可以更了解系统,从而提高其可靠性和总体使用满意度。
{"title":"Extracting Bus Lines Services Information from GPS Registries","authors":"Daniel P. T. Dantas, Antonio A. Rocha, Marcos Lage","doi":"10.1145/3126858.3126881","DOIUrl":"https://doi.org/10.1145/3126858.3126881","url":null,"abstract":"The efficiency of urban mobility is a huge concern of urban population around the world. Because of this reason, city planners spend much of their time monitoring transportations systems and designing solutions in order to improve the system's quality. Among these solutions, the most successful ones are computational tools called Intelligent Transportation Systems (ITS). The success of ITS has encouraged public agencies, owners of the public transportation system information, to share their datasets with the population aiming to stimulate the development of new research and solutions that could help to improve urban mobility. Taking advantage of this trend, this work uses the Rio de Janeiro buses GPS logs dataset to extract some of the main operational information about the city bus system. More specifically, garage locations, start and end points of a route, and the route (the complete sequence of streets) of a bus line are inferred.This information is extremely important for both city planners and population since administrators can benefit from it to better plan the transportation system and the population can become more informed about the system, what improves its reliability and overall usage satisfaction.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130020860","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}
引用次数: 3
A Majority Voting Approach for Sentiment Analysis in Short Texts using Topic Models 基于主题模型的短文本情感分析的多数投票方法
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3126861
R. Carmo, A. Lacerda, D. H. Dalip
Nowadays people can provide feedback on products and services on the web. Site owners can use this kind of information in order to understand more their public preferences. Sentiment Analysis can help in this task, providing methods to infer the polarity of the reviews. In these methods, the classifier can use hints about the polarity of the words and the subject being discussed in order to infer the polarity of the text. However, many of these texts are short and, because of that, the classifier can have difficulties to infer these hints. We here propose a new sentiment analysis method that uses topic models to infer the polarity of short texts. The intuition of this approach is that, by using topics, the classifier is able to better understand the context and improve the performance in this task. In this approach, we first use methods to infer topics such as LDA, BTM and MedLDA in order to represent the review and, then, we apply a classifier (e.g. Linear SVM, Random Forest or Logistic Regression). In this method, we combine the results of classifiers and text representations in two ways: (1) by using single topic representation and multiple classifiers; (2) and using multiple topic representations and a single classifier. We also analyzed the impact of expanding these texts since the topic model methods can have difficulties to deal with the data sparsity present in these reviews. The proposed approach could achieve gains of up to 8.5% compared to our baseline. Moreover, we were able to determine the best classifier (Random Forest) and the best topic detection method (MedLDA).
现在人们可以在网上对产品和服务提供反馈。网站所有者可以使用这类信息来更多地了解他们的公众偏好。情感分析可以帮助完成这项任务,它提供了推断评论极性的方法。在这些方法中,分类器可以使用关于单词极性和正在讨论的主题的提示来推断文本的极性。然而,许多文本都很短,因此,分类器很难推断出这些提示。本文提出了一种利用话题模型推断短文本极性的情感分析方法。这种方法的直观感觉是,通过使用主题,分类器能够更好地理解上下文并提高该任务的性能。在这种方法中,我们首先使用方法来推断主题,如LDA, BTM和MedLDA,以表示评论,然后,我们应用分类器(例如线性支持向量机,随机森林或逻辑回归)。在该方法中,我们通过两种方式将分类器和文本表示的结果结合起来:(1)使用单主题表示和多个分类器;(2)使用多个主题表示和单个分类器。我们还分析了扩展这些文本的影响,因为主题模型方法可能难以处理这些评论中存在的数据稀疏性。与我们的基线相比,拟议的方法可以实现高达8.5%的收益。此外,我们能够确定最佳分类器(Random Forest)和最佳主题检测方法(MedLDA)。
{"title":"A Majority Voting Approach for Sentiment Analysis in Short Texts using Topic Models","authors":"R. Carmo, A. Lacerda, D. H. Dalip","doi":"10.1145/3126858.3126861","DOIUrl":"https://doi.org/10.1145/3126858.3126861","url":null,"abstract":"Nowadays people can provide feedback on products and services on the web. Site owners can use this kind of information in order to understand more their public preferences. Sentiment Analysis can help in this task, providing methods to infer the polarity of the reviews. In these methods, the classifier can use hints about the polarity of the words and the subject being discussed in order to infer the polarity of the text. However, many of these texts are short and, because of that, the classifier can have difficulties to infer these hints. We here propose a new sentiment analysis method that uses topic models to infer the polarity of short texts. The intuition of this approach is that, by using topics, the classifier is able to better understand the context and improve the performance in this task. In this approach, we first use methods to infer topics such as LDA, BTM and MedLDA in order to represent the review and, then, we apply a classifier (e.g. Linear SVM, Random Forest or Logistic Regression). In this method, we combine the results of classifiers and text representations in two ways: (1) by using single topic representation and multiple classifiers; (2) and using multiple topic representations and a single classifier. We also analyzed the impact of expanding these texts since the topic model methods can have difficulties to deal with the data sparsity present in these reviews. The proposed approach could achieve gains of up to 8.5% compared to our baseline. Moreover, we were able to determine the best classifier (Random Forest) and the best topic detection method (MedLDA).","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130990881","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
An Ontology-based Representation Service of Context Information for the Internet of Things 基于本体的物联网上下文信息表示服务
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3126894
E. Veiga, M. F. Arruda, J. Neto, R. B. Neto
In the Internet of Things (IoT) paradigm, a context management system (CMS) should support the context life cycle including acquisition, modeling, reasoning and distribution of context information. The context modeling phase is responsible for the representation of context information in a format which should meet IoT requirements such as expressiveness, reuse, extension and interoperability. In this paper, we present the Hermes Widget IoT service, which represents context information using the semantics of IoT-oriented ontologies such as IoT-Lite and Semantic Sensor Network (SSN). As contribution, Hermes Widget IoT allows any context provider object (e.g. a sensor) to be located, used, and have its corresponding context information represented and made available for querying through the Internet.
在物联网(IoT)范式中,上下文管理系统(CMS)应该支持上下文生命周期,包括上下文信息的获取、建模、推理和分发。上下文建模阶段负责以一种格式表示上下文信息,这种格式应满足物联网需求,如表达性、重用性、可扩展性和互操作性。在本文中,我们提出了Hermes Widget物联网服务,它使用面向物联网的本体(如IoT- lite和语义传感器网络(SSN))的语义表示上下文信息。作为贡献,Hermes Widget IoT允许定位、使用任何上下文提供程序对象(例如传感器),并表示其相应的上下文信息,并使其可通过Internet查询。
{"title":"An Ontology-based Representation Service of Context Information for the Internet of Things","authors":"E. Veiga, M. F. Arruda, J. Neto, R. B. Neto","doi":"10.1145/3126858.3126894","DOIUrl":"https://doi.org/10.1145/3126858.3126894","url":null,"abstract":"In the Internet of Things (IoT) paradigm, a context management system (CMS) should support the context life cycle including acquisition, modeling, reasoning and distribution of context information. The context modeling phase is responsible for the representation of context information in a format which should meet IoT requirements such as expressiveness, reuse, extension and interoperability. In this paper, we present the Hermes Widget IoT service, which represents context information using the semantics of IoT-oriented ontologies such as IoT-Lite and Semantic Sensor Network (SSN). As contribution, Hermes Widget IoT allows any context provider object (e.g. a sensor) to be located, used, and have its corresponding context information represented and made available for querying through the Internet.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"620 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123209311","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}
引用次数: 4
Using Complex Networks to Assess Collaboration in Rap Music: A Study Case of DJ Khaled 用复杂网络评估说唱音乐中的合作:以DJ Khaled为例
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3131605
C. V. Araujo, Rayol Mendonca-Neto, F. Nakamura, E. Nakamura
DJ Khaled is a popular musician that is known for having many collaborators in his songs. Hence, in this paper, we model the evolution of DJ Khaled's collaboration network as nine different networks that incrementally consider the albums of his discography. The network of each album includes the collaborations from previous ones and adds the collaborations from the new album. The artists are represented as nodes and the edges are the number of songs they appear together. Our focus is to answer whether or not: (i) we can identify meaningful communities in this network; and (2) there is an artist who has greater influence as networks emerges. By using the network average clustering coefficient, we found that the artists in the the network tend to naturally cluster in a logical manner. As a result, we identified nine communities, six of them are meaningful, and we identified the rapper Rick Ross as the most influential artist of the network.
DJ Khaled是一位以歌曲中有许多合作者而闻名的流行音乐家。因此,在本文中,我们将DJ Khaled的合作网络的演变建模为九个不同的网络,这些网络逐渐考虑到他的专辑。每张专辑的网络包括以前专辑的合作,并添加新专辑的合作。艺术家们被表示为节点,边缘是他们一起出现的歌曲的数量。我们的重点是回答是否:(i)我们可以在这个网络中找到有意义的社区;(2)随着网络的出现,有一位艺术家的影响力更大。通过使用网络平均聚类系数,我们发现网络中的艺术家倾向于以一种逻辑的方式自然聚类。结果,我们确定了9个社区,其中6个是有意义的,我们确定说唱歌手里克·罗斯(Rick Ross)是该网络中最有影响力的艺术家。
{"title":"Using Complex Networks to Assess Collaboration in Rap Music: A Study Case of DJ Khaled","authors":"C. V. Araujo, Rayol Mendonca-Neto, F. Nakamura, E. Nakamura","doi":"10.1145/3126858.3131605","DOIUrl":"https://doi.org/10.1145/3126858.3131605","url":null,"abstract":"DJ Khaled is a popular musician that is known for having many collaborators in his songs. Hence, in this paper, we model the evolution of DJ Khaled's collaboration network as nine different networks that incrementally consider the albums of his discography. The network of each album includes the collaborations from previous ones and adds the collaborations from the new album. The artists are represented as nodes and the edges are the number of songs they appear together. Our focus is to answer whether or not: (i) we can identify meaningful communities in this network; and (2) there is an artist who has greater influence as networks emerges. By using the network average clustering coefficient, we found that the artists in the the network tend to naturally cluster in a logical manner. As a result, we identified nine communities, six of them are meaningful, and we identified the rapper Rick Ross as the most influential artist of the network.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122731808","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}
引用次数: 10
Detecting Hate, Offensive, and Regular Speech in Short Comments 在短评论中检测仇恨、攻击性和常规言论
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3131576
Thais G. Almeida, Bruno A. Souza, F. Nakamura, E. Nakamura
The freedom of expression provided by the Internet also favors malicious groups that propagate contents of hate, recruit new members, and threaten users. In this context, we propose a new approach for hate speech identification based on Information Theory quantifiers (entropy and divergence) to represent documents. As a differential of our approach, we capture weighted information of words, rather than just their frequency in documents. The results show that our approach overperforms techniques that use data representation, such as TF-IDF and unigrams combined to text classifiers, achieving an F1-score of 86%, 84% e 96% for classifying hate, offensive, and regular speech classes, respectively. Compared to the baselines, our proposal is a win-win solution that improves efficacy (F1-score) and efficiency (by reducing the dimension of the feature vector). The proposed solution is up to 2.27 times faster than the baseline.
互联网提供的言论自由也有利于传播仇恨内容、招募新成员、威胁用户的恶意团体。在此背景下,我们提出了一种基于信息论量词(熵和散度)表示文档的仇恨言论识别新方法。作为我们方法的不同之处,我们捕获了单词的加权信息,而不仅仅是它们在文档中的频率。结果表明,我们的方法优于使用数据表示的技术,例如TF-IDF和结合文本分类器的unigrams,在对仇恨、攻击性和常规语音类进行分类时分别达到86%、84%和96%的f1分数。与基线相比,我们的建议是一个双赢的解决方案,提高了功效(F1-score)和效率(通过降低特征向量的维数)。提出的解决方案比基线快2.27倍。
{"title":"Detecting Hate, Offensive, and Regular Speech in Short Comments","authors":"Thais G. Almeida, Bruno A. Souza, F. Nakamura, E. Nakamura","doi":"10.1145/3126858.3131576","DOIUrl":"https://doi.org/10.1145/3126858.3131576","url":null,"abstract":"The freedom of expression provided by the Internet also favors malicious groups that propagate contents of hate, recruit new members, and threaten users. In this context, we propose a new approach for hate speech identification based on Information Theory quantifiers (entropy and divergence) to represent documents. As a differential of our approach, we capture weighted information of words, rather than just their frequency in documents. The results show that our approach overperforms techniques that use data representation, such as TF-IDF and unigrams combined to text classifiers, achieving an F1-score of 86%, 84% e 96% for classifying hate, offensive, and regular speech classes, respectively. Compared to the baselines, our proposal is a win-win solution that improves efficacy (F1-score) and efficiency (by reducing the dimension of the feature vector). The proposed solution is up to 2.27 times faster than the baseline.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115274905","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}
引用次数: 9
Rate and Complexity-Aware Coding Scheme for Fixed-Camera Videos Based on Region-of-Interest Detection 基于兴趣区域检测的固定摄像机视频速率和复杂度感知编码方案
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3131599
Cristiano Santos, R. Conceição, L. Agostini, G. Corrêa, B. Zatt, M. Porto
This paper presents a rate and complexity-aware coding scheme for fixed-camera videos that are designed to improve image quality in Regions of Interest (ROI) by prioritizing the encoding of such regions through the use of a modified mode decision equation. ROIs are defined in this work as faces, with the application of a face detection algorithm. Background Images (BGI) are also detected with the aim of reducing bitrate in coding blocks belonging to these areas. Finally, the proposed scheme also applies an early decision method intending to reduce coding time. Experimental results show that the proposed scheme is capable of improving the image quality in 0.99 dB in ROIs, reaching an improvement of 1.16 dB in the best case. Also, the scheme achieves an encoding time reduction of up to 55% (about 5.5%, on average) with unexpressive variations in the required bitrate.
本文提出了一种速率和复杂性感知的固定摄像机视频编码方案,该方案旨在通过使用改进的模式决策方程对感兴趣区域(ROI)的编码进行优先排序,从而提高感兴趣区域(ROI)的图像质量。在这项工作中,roi被定义为人脸,并应用了人脸检测算法。背景图像(BGI)也被检测,目的是降低属于这些区域的编码块的比特率。最后,该方案还采用了一种早期决策方法,旨在减少编码时间。实验结果表明,该方案能够将roi的图像质量提高0.99 dB,在最佳情况下可提高1.16 dB。此外,该方案实现了编码时间减少高达55%(约5.5%,平均),在所需的比特率无明显变化。
{"title":"Rate and Complexity-Aware Coding Scheme for Fixed-Camera Videos Based on Region-of-Interest Detection","authors":"Cristiano Santos, R. Conceição, L. Agostini, G. Corrêa, B. Zatt, M. Porto","doi":"10.1145/3126858.3131599","DOIUrl":"https://doi.org/10.1145/3126858.3131599","url":null,"abstract":"This paper presents a rate and complexity-aware coding scheme for fixed-camera videos that are designed to improve image quality in Regions of Interest (ROI) by prioritizing the encoding of such regions through the use of a modified mode decision equation. ROIs are defined in this work as faces, with the application of a face detection algorithm. Background Images (BGI) are also detected with the aim of reducing bitrate in coding blocks belonging to these areas. Finally, the proposed scheme also applies an early decision method intending to reduce coding time. Experimental results show that the proposed scheme is capable of improving the image quality in 0.99 dB in ROIs, reaching an improvement of 1.16 dB in the best case. Also, the scheme achieves an encoding time reduction of up to 55% (about 5.5%, on average) with unexpressive variations in the required bitrate.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129620717","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}
引用次数: 2
Explaining Recommendations: Fidelity versus Interpretability 解释建议:忠实与可解释性
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3133312
D. Bridge
A hungry academic who is attending the WebMedia conference in Gramado uses a mobile phone app to obtain a recommendation for a place-to-eat. The restaurant that the app recommends is not within walking distance and serves a fusion-style cuisine with which the academic is unfamiliar. Should she accept the recommendation? Her confidence in the recommendation might be improved by an explanation of the recommender system's decision-making. But the explanations that recommender systems provide at present are often post hoc: fidelity to the system's decision-making is sometimes sacrificed for interpretability. Are fidelity and interpretability always in conflict? Or can they can be reconciled without damaging the quality of the recommendations themselves? This talk will review the kinds of explanations given by recommender systems. It will describe a new generation of recommender systems in which recommendation and explanation are more intimately connected and which seeks to maintain the quality of the recommendations while providing explanations that are both intelligible and reasonably faithful to the system's operation.
一位饥不择食的学者正在格拉玛多参加WebMedia会议,他使用一款手机应用程序来获得一个吃饭地点的推荐。应用程序推荐的餐厅不在步行距离之内,提供这位学者不熟悉的融合式菜肴。她应该接受这个建议吗?她对推荐的信心可以通过解释推荐系统的决策来提高。但目前推荐系统提供的解释往往是事后的:有时为了可解释性而牺牲对系统决策的忠诚。保真度和可解释性总是存在冲突吗?或者,它们是否能够在不损害推荐本身质量的情况下得到协调?本演讲将回顾推荐系统给出的各种解释。它将描述新一代的推荐系统,其中推荐和解释更紧密地联系在一起,并寻求保持推荐的质量,同时提供既可理解又合理地忠实于系统操作的解释。
{"title":"Explaining Recommendations: Fidelity versus Interpretability","authors":"D. Bridge","doi":"10.1145/3126858.3133312","DOIUrl":"https://doi.org/10.1145/3126858.3133312","url":null,"abstract":"A hungry academic who is attending the WebMedia conference in Gramado uses a mobile phone app to obtain a recommendation for a place-to-eat. The restaurant that the app recommends is not within walking distance and serves a fusion-style cuisine with which the academic is unfamiliar. Should she accept the recommendation? Her confidence in the recommendation might be improved by an explanation of the recommender system's decision-making. But the explanations that recommender systems provide at present are often post hoc: fidelity to the system's decision-making is sometimes sacrificed for interpretability. Are fidelity and interpretability always in conflict? Or can they can be reconciled without damaging the quality of the recommendations themselves? This talk will review the kinds of explanations given by recommender systems. It will describe a new generation of recommender systems in which recommendation and explanation are more intimately connected and which seeks to maintain the quality of the recommendations while providing explanations that are both intelligible and reasonably faithful to the system's operation.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128847308","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
A Model-Driven Approach for Code Generation for Web-based Information Systems Built with Frameworks 基于框架的基于web的信息系统代码生成的模型驱动方法
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3126863
Nilber Vittorazzi de Almeida, Silas Louzada Campos, V. Souza
In the field of Web Engineering, there are several methods proposed for the development of Web-based information systems (WISs). FrameWeb is a method that aims to develop WISs that use certain types of frameworks in their architecture, proposing models that incorporate concepts of these frameworks during system design. The method's modeling language is based on Model-Driven Development techniques, making it extensible to support different frameworks and development platforms. In this paper, we present a code generation tool for FrameWeb which harnesses the method's extensibility by being based on its language's meta-models. The tool works with an associated visual editor for FrameWeb models and showed promising results in initial evaluation efforts.
在Web工程领域,有几种基于Web的信息系统(WISs)的开发方法。FrameWeb是一种旨在开发在其体系结构中使用某些类型框架的wis的方法,在系统设计期间提出包含这些框架概念的模型。该方法的建模语言基于模型驱动开发技术,使其可扩展以支持不同的框架和开发平台。在本文中,我们提出了一个用于FrameWeb的代码生成工具,该工具通过基于其语言的元模型来利用方法的可扩展性。该工具与FrameWeb模型的相关可视化编辑器一起工作,并在最初的评估工作中显示出令人鼓舞的结果。
{"title":"A Model-Driven Approach for Code Generation for Web-based Information Systems Built with Frameworks","authors":"Nilber Vittorazzi de Almeida, Silas Louzada Campos, V. Souza","doi":"10.1145/3126858.3126863","DOIUrl":"https://doi.org/10.1145/3126858.3126863","url":null,"abstract":"In the field of Web Engineering, there are several methods proposed for the development of Web-based information systems (WISs). FrameWeb is a method that aims to develop WISs that use certain types of frameworks in their architecture, proposing models that incorporate concepts of these frameworks during system design. The method's modeling language is based on Model-Driven Development techniques, making it extensible to support different frameworks and development platforms. In this paper, we present a code generation tool for FrameWeb which harnesses the method's extensibility by being based on its language's meta-models. The tool works with an associated visual editor for FrameWeb models and showed promising results in initial evaluation efforts.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116416836","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}
引用次数: 4
Generating Entity Representation from Online Discussions: Challenges and an Evaluation Framework 从在线讨论中生成实体表示:挑战和评估框架
Pub Date : 2017-10-17 DOI: 10.1145/3126858.3126882
T. C. Loures, Pedro O. S. Vaz de Melo, Adriano Veloso
Because of the ubiquitous use of the Internet in current society, it is easy to find groups or communities of people discussing about the most varied subjects. Learning about these subjects (or entities) from such discussions is of great interest for companies, organizations, public figures (e.g. politicians) and researchers alike. In this paper, we explore the problem of learning entity representations using online discussions about them as the only source of information. While such discussions may reveal relevant and surprising information about the corresponding subjects, they may also be completely irrelevant. As another challenge, while regular text documents usually contain a well structured language, online discussions often contain informal and mispelled words. Here we formally define the problem, propose a new benchmark for evaluating vector representation methods, and perform a deep evaluation of well-known techniques using three proposed evaluation scenarios: (i) clustering, (ii) ordering and (iii) recommendation. Results show that each method is better than at least one other in some evaluation.
由于互联网在当今社会的普遍使用,很容易找到人们讨论各种各样的主题的团体或社区。从这些讨论中了解这些主题(或实体)对公司、组织、公众人物(如政治家)和研究人员都很有兴趣。在本文中,我们探讨了使用在线讨论作为唯一信息源来学习实体表示的问题。虽然这样的讨论可能会揭示出有关相应主题的相关和令人惊讶的信息,但它们也可能完全无关紧要。另一个挑战是,虽然常规文本文档通常包含结构良好的语言,但在线讨论通常包含非正式和拼写错误的单词。在这里,我们正式定义了这个问题,提出了一个评估向量表示方法的新基准,并使用三种提出的评估场景(i)聚类,(ii)排序和(iii)推荐)对知名技术进行了深入评估。结果表明,每种方法在某些评价中至少优于另一种方法。
{"title":"Generating Entity Representation from Online Discussions: Challenges and an Evaluation Framework","authors":"T. C. Loures, Pedro O. S. Vaz de Melo, Adriano Veloso","doi":"10.1145/3126858.3126882","DOIUrl":"https://doi.org/10.1145/3126858.3126882","url":null,"abstract":"Because of the ubiquitous use of the Internet in current society, it is easy to find groups or communities of people discussing about the most varied subjects. Learning about these subjects (or entities) from such discussions is of great interest for companies, organizations, public figures (e.g. politicians) and researchers alike. In this paper, we explore the problem of learning entity representations using online discussions about them as the only source of information. While such discussions may reveal relevant and surprising information about the corresponding subjects, they may also be completely irrelevant. As another challenge, while regular text documents usually contain a well structured language, online discussions often contain informal and mispelled words. Here we formally define the problem, propose a new benchmark for evaluating vector representation methods, and perform a deep evaluation of well-known techniques using three proposed evaluation scenarios: (i) clustering, (ii) ordering and (iii) recommendation. Results show that each method is better than at least one other in some evaluation.","PeriodicalId":338362,"journal":{"name":"Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web","volume":"91 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116531794","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}
引用次数: 3
期刊
Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1