首页 > 最新文献

ACM Transactions on the Web最新文献

英文 中文
To Re-experience the Web: A Framework for the Transformation and Replay of Archived Web Pages 重新体验网络:一个转换和重放存档网页的框架
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-27 DOI: 10.1145/3589206
John A. Berlin, Mat Kelly, Michael L. Nelson, M. Weigle
When replaying an archived web page, or memento, the fundamental expectation is that the page should be viewable and function exactly as it did at archival time. However, this expectation requires web archives upon replay to modify the page and its embedded resources so that all resources and links reference the archive rather than the original server. Although these modifications necessarily change the state of the representation, it is understood that without them the replay of mementos from the archive would not be possible. The process of replaying mementos and the modifications made to the representations by web archives varies between archives. Because of this, there is no standard terminology for describing the replay and needed modifications. In this paper, we propose terminology for describing the existing styles of replay and the modifications made on the part of web archives to mementos to facilitate replay. Because of issues discovered with server-side only modifications, we propose a general framework for the auto-generation of client-side rewriting libraries. Finally, we evaluate the effectiveness of using a generated client-side rewriting library to augment the existing replay systems of web archives by crawling mementos replayed from the Internet Archive’s Wayback Machine with and without the generated client-side rewriter. By using the generated client-side rewriter, we were able to decrease the cumulative number of requests blocked by the content security policy of the Wayback Machine for 577 mementos by 87.5% and increased the cumulative number of requests made by 32.8%. We were also able to replay mementos that were previously not replayable from the Internet Archive. Many of the client-side rewriting ideas described in this work have been implemented into Wombat, a client-side URL rewriting system that is used by the Webrecorder, Pywb, and Wayback Machine playback systems.
当回放存档的网页或纪念品时,基本的期望是该页面应该是可查看的,并且功能与存档时完全相同。然而,这种期望需要在回放时使用web存档来修改页面及其嵌入的资源,以便所有资源和链接都引用存档,而不是原始服务器。尽管这些修改必然会改变表现的状态,但可以理解的是,如果没有它们,就不可能从档案中回放纪念品。网络档案馆回放纪念品的过程和对表现形式的修改因档案馆而异。因此,没有标准的术语来描述回放和所需的修改。在本文中,我们提出了描述现有回放风格的术语,以及网络档案对纪念品进行的修改,以便于回放。由于只在服务器端进行修改时发现了问题,我们提出了一个用于自动生成客户端重写库的通用框架。最后,我们评估了使用生成的客户端重写库来增强现有的网络档案回放系统的有效性,通过对从互联网档案的Wayback Machine回放的纪念品进行爬网,无论是否使用生成的客户机端重写器。通过使用生成的客户端重写器,我们能够将被Wayback Machine的内容安全策略阻止的577个纪念品的累计请求数量减少87.5%,并将累计请求数量增加32.8%。我们还能够回放以前无法从Internet档案中回放的纪念品。这项工作中描述的许多客户端重写思想已经在Wombat中实现,这是一个客户端URL重写系统,由Webrecorder、Pywb和Wayback Machine播放系统使用。
{"title":"To Re-experience the Web: A Framework for the Transformation and Replay of Archived Web Pages","authors":"John A. Berlin, Mat Kelly, Michael L. Nelson, M. Weigle","doi":"10.1145/3589206","DOIUrl":"https://doi.org/10.1145/3589206","url":null,"abstract":"When replaying an archived web page, or memento, the fundamental expectation is that the page should be viewable and function exactly as it did at archival time. However, this expectation requires web archives upon replay to modify the page and its embedded resources so that all resources and links reference the archive rather than the original server. Although these modifications necessarily change the state of the representation, it is understood that without them the replay of mementos from the archive would not be possible. The process of replaying mementos and the modifications made to the representations by web archives varies between archives. Because of this, there is no standard terminology for describing the replay and needed modifications. In this paper, we propose terminology for describing the existing styles of replay and the modifications made on the part of web archives to mementos to facilitate replay. Because of issues discovered with server-side only modifications, we propose a general framework for the auto-generation of client-side rewriting libraries. Finally, we evaluate the effectiveness of using a generated client-side rewriting library to augment the existing replay systems of web archives by crawling mementos replayed from the Internet Archive’s Wayback Machine with and without the generated client-side rewriter. By using the generated client-side rewriter, we were able to decrease the cumulative number of requests blocked by the content security policy of the Wayback Machine for 577 mementos by 87.5% and increased the cumulative number of requests made by 32.8%. We were also able to replay mementos that were previously not replayable from the Internet Archive. Many of the client-side rewriting ideas described in this work have been implemented into Wombat, a client-side URL rewriting system that is used by the Webrecorder, Pywb, and Wayback Machine playback systems.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47117652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Improving Conformance of Web Services: A Constraint-based Model-driven Approach 改进Web服务的一致性:基于约束的模型驱动方法
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-27 DOI: https://dl.acm.org/doi/10.1145/3580515
Chang-Ai Sun, An Fu, Jingting Jia, Meng Li, Jun Han

Web services have been widely used to develop complex distributed software systems in the context of Service Oriented Architecture (SOA). As a standard for describing Web services, the Web Service Description Language (WSDL) provides a universal mechanism to describe the service’s functionalities for the service consumers. However, the current WSDL only provides the description of the interfaces to a Web Service without any restrictions or assumptions on how to properly invoke the service, resulting in divergent understanding of the Web service’s behavior between the service developer and service consumer. A particular challenge is how to make explicit the various behavior assumptions and restrictions of a service (for the user), and make sure that the service implementation conforms to them (for the developer). In this article, we propose a constraint-based model-driven approach to improving the behavior conformance of Web services. In our approach, constraints are introduced in an extended WSDL, called CxWSDL, to formally and explicitly express the implicit restrictions and assumptions on the behavior of a Web service, and then the predefined constraints are used to derive test cases in a model-driven manner to test the service implementation’s conformance to its behavior constraints from the user’s perspective. An empirical study involving four real-life Web services was conducted to evaluate the effectiveness of our approach, and four actual inconsistencies were discovered.

在面向服务的体系结构(SOA)环境中,Web服务已被广泛用于开发复杂的分布式软件系统。作为描述Web服务的标准,Web服务描述语言(WSDL)提供了一种通用机制来为服务使用者描述服务的功能。然而,当前的WSDL只提供了Web服务接口的描述,而没有对如何正确调用服务进行任何限制或假设,从而导致服务开发人员和服务使用者之间对Web服务行为的理解存在分歧。一个特别的挑战是如何明确服务的各种行为假设和限制(对于用户),并确保服务实现符合这些假设和限制(对于开发人员)。在本文中,我们提出了一种基于约束的模型驱动方法来改进Web服务的行为一致性。在我们的方法中,在称为CxWSDL的扩展WSDL中引入约束,以形式化和显式地表达对Web服务行为的隐式限制和假设,然后使用预定义的约束以模型驱动的方式派生测试用例,以从用户的角度测试服务实现是否符合其行为约束。我们进行了一项涉及四个实际Web服务的实证研究,以评估我们的方法的有效性,并发现了四个实际的不一致之处。
{"title":"Improving Conformance of Web Services: A Constraint-based Model-driven Approach","authors":"Chang-Ai Sun, An Fu, Jingting Jia, Meng Li, Jun Han","doi":"https://dl.acm.org/doi/10.1145/3580515","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3580515","url":null,"abstract":"<p>Web services have been widely used to develop complex distributed software systems in the context of Service Oriented Architecture (SOA). As a standard for describing Web services, the Web Service Description Language (WSDL) provides a universal mechanism to describe the service’s functionalities for the service consumers. However, the current WSDL only provides the description of the interfaces to a Web Service without any restrictions or assumptions on how to properly invoke the service, resulting in divergent understanding of the Web service’s behavior between the service developer and service consumer. A particular challenge is how to make explicit the various behavior assumptions and restrictions of a service (for the user), and make sure that the service implementation conforms to them (for the developer). In this article, we propose a constraint-based model-driven approach to improving the behavior conformance of Web services. In our approach, constraints are introduced in an extended WSDL, called CxWSDL, to formally and explicitly express the implicit restrictions and assumptions on the behavior of a Web service, and then the predefined constraints are used to derive test cases in a model-driven manner to test the service implementation’s conformance to its behavior constraints from the user’s perspective. An empirical study involving four real-life Web services was conducted to evaluate the effectiveness of our approach, and four actual inconsistencies were discovered.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 33","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FinTech on the Web: An Overview 网络上的金融科技:概述
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-27 DOI: https://dl.acm.org/doi/10.1145/3572404
Chung-Chi Chen, Hen-Hsen Huang, Hiroya Takamura, Makoto P. Kato, Yu-Lieh Huang

In this article, we provide an overview of ACM TWEB’s special issue, Financial Technology on the Web. This special issue covers diverse topics: (1) a new architecture for leveraging online news to investment and risk management, (2) a cross-platform analysis of the post quality and users’ behaviors, and (3) an empirical study on disentangling decentralized finance compositions. In addition to a guide for the special issue, we also share a brief opinion on the future of financial technology on the Web.

在本文中,我们概述了ACM TWEB的特刊《网络上的金融技术》。本期特刊涵盖了多个主题:(1)利用在线新闻进行投资和风险管理的新架构,(2)帖子质量和用户行为的跨平台分析,以及(3)对分散金融组合的实证研究。除了为本期特刊提供指南外,我们还就网络金融科技的未来分享了一些简单的看法。
{"title":"FinTech on the Web: An Overview","authors":"Chung-Chi Chen, Hen-Hsen Huang, Hiroya Takamura, Makoto P. Kato, Yu-Lieh Huang","doi":"https://dl.acm.org/doi/10.1145/3572404","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3572404","url":null,"abstract":"<p>In this article, we provide an overview of ACM TWEB’s special issue, <i>Financial Technology on the Web</i>. This special issue covers diverse topics: (1) a new architecture for leveraging online news to investment and risk management, (2) a cross-platform analysis of the post quality and users’ behaviors, and (3) an empirical study on disentangling decentralized finance compositions. In addition to a guide for the special issue, we also share a brief opinion on the future of financial technology on the Web.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 29","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A User-Centric Analysis of Social Media for Stock Market Prediction 以用户为中心的社会媒体对股市预测的分析
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-27 DOI: https://dl.acm.org/doi/10.1145/3532856
Mohamed Reda Bouadjenek, Scott Sanner, Ga Wu

Social media platforms such as Twitter or StockTwits are widely used for sharing stock market opinions between investors, traders, and entrepreneurs. Empirically, previous work has shown that the content posted on these social media platforms can be leveraged to predict various aspects of stock market performance. Nonetheless, actors on these social media platforms may not always have altruistic motivations and may instead seek to influence stock trading behavior through the (potentially misleading) information they post. While a lot of previous work has sought to analyze how social media can be used to predict the stock market, there remain many questions regarding the quality of the predictions and the behavior of active users on these platforms. To this end, this article seeks to address a number of open research questions: Which social media platform is more predictive of stock performance? What posted content is actually predictive, and over what time horizon? How does stock market posting behavior vary among different users? Are all users trustworthy or do some user’s predictions consistently mislead about the true stock movement? To answer these questions, we analyzed data from Twitter and StockTwits covering almost 5 years of posted messages spanning 2015 to 2019. The results of this large-scale study provide a number of important insights among which we present the following: (i) StockTwits is a more predictive source of information than Twitter, leading us to focus our analysis on StockTwits; (ii) on StockTwits, users’ self-labeled sentiments are correlated with the stock market but are only slightly predictive in aggregate over the short-term; (iii) there are at least three clear types of temporal predictive behavior for users over a 144 days horizon: short, medium, and long term; and (iv) consistently incorrect users who are reliably wrong tend to exhibit what we conjecture to be “botlike” post content and their removal from the data tends to improve stock market predictions from self-labeled content.

像Twitter或StockTwits这样的社交媒体平台被广泛用于投资者、交易员和企业家之间分享股市观点。从经验上看,之前的研究表明,这些社交媒体平台上发布的内容可以用来预测股市表现的各个方面。尽管如此,这些社交媒体平台上的行为者可能并不总是有无私的动机,而是可能试图通过他们发布的(可能具有误导性的)信息来影响股票交易行为。虽然之前的很多工作都试图分析如何利用社交媒体来预测股市,但关于预测的质量和这些平台上活跃用户的行为,仍然存在许多问题。为此,本文试图解决一些悬而未决的研究问题:哪个社交媒体平台更能预测股票表现?哪些发布的内容实际上是预测性的,在什么时间范围内?不同用户的股市发帖行为有何不同?是所有的用户都值得信赖,还是一些用户的预测一直误导了真实的股票走势?为了回答这些问题,我们分析了Twitter和StockTwits的数据,涵盖了2015年至2019年近5年的发布信息。这项大规模研究的结果提供了许多重要的见解,其中我们提出以下几点:(i) StockTwits是比Twitter更具预测性的信息来源,这使得我们将分析重点放在StockTwits上;(ii)在StockTwits上,用户自我标记的情绪与股市相关,但在短期内总体上只有轻微的预测性;(iii)用户在144天内至少有三种明确的时间预测行为:短期、中期和长期;(iv)一贯错误的用户往往会表现出我们推测的“机器人式”帖子内容,将他们从数据中删除往往会改善自标签内容对股市的预测。
{"title":"A User-Centric Analysis of Social Media for Stock Market Prediction","authors":"Mohamed Reda Bouadjenek, Scott Sanner, Ga Wu","doi":"https://dl.acm.org/doi/10.1145/3532856","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3532856","url":null,"abstract":"<p>Social media platforms such as Twitter or StockTwits are widely used for sharing stock market opinions between investors, traders, and entrepreneurs. Empirically, previous work has shown that the content posted on these social media platforms can be leveraged to predict various aspects of stock market performance. Nonetheless, actors on these social media platforms may not always have altruistic motivations and may instead seek to influence stock trading behavior through the (potentially misleading) information they post. While a lot of previous work has sought to analyze how social media can be used to predict the stock market, there remain many questions regarding the quality of the predictions and the behavior of active users on these platforms. To this end, this article seeks to address a number of open research questions: Which social media platform is more predictive of stock performance? What posted content is actually predictive, and over what time horizon? How does stock market posting behavior vary among different users? Are all users trustworthy or do some user’s predictions consistently mislead about the true stock movement? To answer these questions, we analyzed data from Twitter and StockTwits covering almost 5 years of posted messages spanning 2015 to 2019. The results of this large-scale study provide a number of important insights among which we present the following: (i) StockTwits is a more predictive source of information than Twitter, leading us to focus our analysis on StockTwits; (ii) on StockTwits, users’ self-labeled sentiments are correlated with the stock market but are only slightly predictive in aggregate over the short-term; (iii) there are at least three clear types of temporal predictive behavior for users over a 144 days horizon: short, medium, and long term; and (iv) consistently incorrect users who are reliably wrong tend to exhibit what we conjecture to be “botlike” post content and their removal from the data tends to improve stock market predictions from self-labeled content.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 32","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Investment and Risk Management with Online News and Heterogeneous Networks 基于在线新闻和异构网络的投资和风险管理
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-27 DOI: https://dl.acm.org/doi/10.1145/3532858
Gary Ang, Ee-Peng Lim

Stock price movements in financial markets are influenced by large volumes of news from diverse sources on the web, e.g., online news outlets, blogs, social media. Extracting useful information from online news for financial tasks, e.g., forecasting stock returns or risks, is, however, challenging due to the low signal-to-noise ratios of such online information. Assessing the relevance of each news article to the price movements of individual stocks is also difficult, even for human experts. In this article, we propose the Guided Global-Local Attention-based Multimodal Heterogeneous Network (GLAM) model, which comprises novel attention-based mechanisms for multimodal sequential and graph encoding, a guided learning strategy, and a multitask training objective. GLAM uses multimodal information, heterogeneous relationships between companies and leverages significant local responses of individual stock prices to online news to extract useful information from diverse global online news relevant to individual stocks for multiple forecasting tasks. Our extensive experiments with multiple datasets show that GLAM outperforms other state-of-the-art models on multiple forecasting tasks and investment and risk management application case-studies.

金融市场的股价走势受到来自网络上各种来源的大量新闻的影响,例如在线新闻媒体、博客、社交媒体。然而,由于在线信息的低信噪比,从在线新闻中提取有用的信息用于金融任务,例如预测股票收益或风险,是具有挑战性的。评估每篇新闻文章与个股价格走势的相关性也很困难,即使对人类专家来说也是如此。在本文中,我们提出了一种基于引导全局-局部注意的多模态异构网络(GLAM)模型,该模型包含了一种新的基于注意的多模态序列和图编码机制、一种引导学习策略和一个多任务训练目标。GLAM利用多模态信息、公司之间的异质关系,并利用个别股票价格对在线新闻的显著本地反应,从与个股相关的各种全球在线新闻中提取有用信息,用于多种预测任务。我们对多个数据集的广泛实验表明,GLAM在多个预测任务以及投资和风险管理应用案例研究中优于其他最先进的模型。
{"title":"Investment and Risk Management with Online News and Heterogeneous Networks","authors":"Gary Ang, Ee-Peng Lim","doi":"https://dl.acm.org/doi/10.1145/3532858","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3532858","url":null,"abstract":"<p>Stock price movements in financial markets are influenced by large volumes of news from diverse sources on the web, e.g., online news outlets, blogs, social media. Extracting useful information from online news for financial tasks, e.g., forecasting stock returns or risks, is, however, challenging due to the low signal-to-noise ratios of such online information. Assessing the relevance of each news article to the price movements of individual stocks is also difficult, even for human experts. In this article, we propose the Guided Global-Local Attention-based Multimodal Heterogeneous Network (GLAM) model, which comprises novel attention-based mechanisms for multimodal sequential and graph encoding, a guided learning strategy, and a multitask training objective. GLAM uses multimodal information, heterogeneous relationships between companies and leverages significant local responses of individual stock prices to online news to extract useful information from diverse global online news relevant to individual stocks for multiple forecasting tasks. Our extensive experiments with multiple datasets show that GLAM outperforms other state-of-the-art models on multiple forecasting tasks and investment and risk management application case-studies.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 30","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis 反向最大内积搜索:公式、算法和分析
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-16 DOI: 10.1145/3587215
Daichi Amagata, Takahiro Hara
The MIPS (maximum inner product search), which finds the item with the highest inner product with a given query user, is an essential problem in the recommendation field. Usually, e-commerce companies face situations where they want to promote and sell new or discounted items. In these situations, we have to consider a question: who are interested in the items and how to find them? This article answers this question by addressing a new problem called reverse maximum inner product search (reverse MIPS). Given a query vector and two sets of vectors (user vectors and item vectors), the problem of reverse MIPS finds a set of user vectors whose inner product with the query vector is the maximum among the query and item vectors. Although the importance of this problem is clear, its straightforward implementation incurs a computationally expensive cost. We therefore propose Simpfer, a simple, fast, and exact algorithm for reverse MIPS. In an offline phase, Simpfer builds a simple index that maintains a lower-bound of the maximum inner product. By exploiting this index, Simpfer judges whether the query vector can have the maximum inner product or not, for a given user vector, in a constant time. Our index enables filtering user vectors, which cannot have the maximum inner product with the query vector, in a batch. We theoretically demonstrate that Simpfer outperforms baselines employing state-of-the-art MIPS techniques. In addition, we answer two new research questions. Can approximation algorithms further improve reverse MIPS processing? Is there an exact algorithm that is faster than Simpfer? For the former, we show that approximation with quality guarantee provides a little speed-up. For the latter, we propose Simpfer++, a theoretically and practically faster algorithm than Simpfer. Our extensive experiments on real datasets show that Simpfer is at least two orders of magnitude faster than the baselines, and Simpfer++ further improves the online processing time.
MIPS(maximum internal product search,最大内积搜索)是推荐领域的一个重要问题,它可以在给定的查询用户中找到内积最高的项目。通常,电子商务公司会面临想要推广和销售新商品或折扣商品的情况。在这种情况下,我们必须考虑一个问题:谁对这些物品感兴趣,如何找到它们?本文通过解决一个称为反向最大内积搜索(反向MIPS)的新问题来回答这个问题。给定一个查询向量和两组向量(用户向量和项目向量),反向MIPS问题在查询和项目向量中找到一组用户向量,其与查询向量的内积最大。尽管这个问题的重要性是显而易见的,但它的直接实现带来了计算上昂贵的成本。因此,我们提出了一种简单、快速、准确的反向MIPS算法Simpfer。在离线阶段,Simpfer构建一个简单的索引,该索引保持最大内积的下限。通过利用这个索引,Simpfer判断对于给定的用户向量,查询向量是否可以在恒定时间内具有最大内积。我们的索引允许在批处理中过滤用户向量,这些向量不能与查询向量具有最大内积。我们从理论上证明了Simpfer优于采用最先进MIPS技术的基线。此外,我们还回答了两个新的研究问题。近似算法能否进一步改进反向MIPS处理?有没有比Simpfer更快的精确算法?对于前者,我们证明了具有质量保证的近似提供了一点加速。对于后者,我们提出了Simpfer++,这是一种理论上和实践上都比Simpfer更快的算法。我们在真实数据集上的大量实验表明,Simpfer至少比基线快两个数量级,Simpfer++进一步提高了在线处理时间。
{"title":"Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis","authors":"Daichi Amagata, Takahiro Hara","doi":"10.1145/3587215","DOIUrl":"https://doi.org/10.1145/3587215","url":null,"abstract":"The MIPS (maximum inner product search), which finds the item with the highest inner product with a given query user, is an essential problem in the recommendation field. Usually, e-commerce companies face situations where they want to promote and sell new or discounted items. In these situations, we have to consider a question: who are interested in the items and how to find them? This article answers this question by addressing a new problem called reverse maximum inner product search (reverse MIPS). Given a query vector and two sets of vectors (user vectors and item vectors), the problem of reverse MIPS finds a set of user vectors whose inner product with the query vector is the maximum among the query and item vectors. Although the importance of this problem is clear, its straightforward implementation incurs a computationally expensive cost. We therefore propose Simpfer, a simple, fast, and exact algorithm for reverse MIPS. In an offline phase, Simpfer builds a simple index that maintains a lower-bound of the maximum inner product. By exploiting this index, Simpfer judges whether the query vector can have the maximum inner product or not, for a given user vector, in a constant time. Our index enables filtering user vectors, which cannot have the maximum inner product with the query vector, in a batch. We theoretically demonstrate that Simpfer outperforms baselines employing state-of-the-art MIPS techniques. In addition, we answer two new research questions. Can approximation algorithms further improve reverse MIPS processing? Is there an exact algorithm that is faster than Simpfer? For the former, we show that approximation with quality guarantee provides a little speed-up. For the latter, we propose Simpfer++, a theoretically and practically faster algorithm than Simpfer. Our extensive experiments on real datasets show that Simpfer is at least two orders of magnitude faster than the baselines, and Simpfer++ further improves the online processing time.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46937459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Niffler: Real-time Device-level Anomalies Detection in Smart Home 嗅嗅:智能家居中实时设备级异常检测
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-01 DOI: 10.1145/3586073
Haohua Du, Yue Wang, Xiaoya Xu, Mingsheng Liu
Device-level security has become a major concern in smart home systems. Detecting problems in smart home sytems strives to increase accuracy in near real time without hampering the regular tasks of the smart home. The current state of the art in detecting anomalies in smart home devices is mainly focused on the app level, which provides a basic level of security by assuming that the devices are functioning correctly. However, this approach is insufficient for ensuring the overall security of the system, as it overlooks the possibility of anomalies occurring at the lower layers such as the devices. In this article, we propose a novel notion, correlated graph, and with the aid of that, we develop our system to detect misbehaving devices without modifying the existing system. Our correlated graphs explicitly represent the contextual correlations among smart devices with little knowledge about the system. We further propose a linkage path model and a sensitivity ranking method to assist in detecting the abnormalities. We implement a semi-automatic prototype of our approach, evaluate it in real-world settings, and demonstrate its efficiency, which achieves an accuracy of around 90% in near real time.
设备级安全已成为智能家居系统的主要关注点。智能家居系统中的问题检测力求在不妨碍智能家居常规任务的情况下,近乎实时地提高准确性。目前在智能家居设备中检测异常的最新技术主要集中在应用程序层面,它通过假设设备正常运行来提供基本的安全性。但是,这种方法忽略了设备等底层发生异常的可能性,不足以保证系统的整体安全性。在本文中,我们提出了一个新的概念,关联图,并借助它,我们开发了我们的系统来检测不正常的设备,而不修改现有的系统。我们的相关图明确地表示了对系统知之甚少的智能设备之间的上下文相关性。我们进一步提出了一种链接路径模型和灵敏度排序方法来帮助检测异常。我们实现了该方法的半自动原型,在现实环境中对其进行了评估,并证明了其效率,在接近实时的情况下达到了90%左右的准确率。
{"title":"Niffler: Real-time Device-level Anomalies Detection in Smart Home","authors":"Haohua Du, Yue Wang, Xiaoya Xu, Mingsheng Liu","doi":"10.1145/3586073","DOIUrl":"https://doi.org/10.1145/3586073","url":null,"abstract":"Device-level security has become a major concern in smart home systems. Detecting problems in smart home sytems strives to increase accuracy in near real time without hampering the regular tasks of the smart home. The current state of the art in detecting anomalies in smart home devices is mainly focused on the app level, which provides a basic level of security by assuming that the devices are functioning correctly. However, this approach is insufficient for ensuring the overall security of the system, as it overlooks the possibility of anomalies occurring at the lower layers such as the devices. In this article, we propose a novel notion, correlated graph, and with the aid of that, we develop our system to detect misbehaving devices without modifying the existing system. Our correlated graphs explicitly represent the contextual correlations among smart devices with little knowledge about the system. We further propose a linkage path model and a sensitivity ranking method to assist in detecting the abnormalities. We implement a semi-automatic prototype of our approach, evaluate it in real-world settings, and demonstrate its efficiency, which achieves an accuracy of around 90% in near real time.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"17 1","pages":"1 - 27"},"PeriodicalIF":3.5,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41445954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Novel Review Helpfulness Measure based on the User-Review-Item Paradigm 基于用户评论项目范式的一种新的评论帮助度测度
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-02-23 DOI: 10.1145/3585280
Luca Pajola, Dongkai Chen, M. Conti, V. S. Subrahmanian
Review platforms are viral online services where users share and read opinions about products (e.g., a smartphone) or experiences (e.g., a meal at a restaurant). Other users may be influenced by such opinions when making deciding what to buy. The usability of review platforms is currently limited by the massive number of opinions on many products. Therefore, showing only the most helpful reviews for each product is in the best interests of both users and the platform (e.g., Amazon). The current state of the art is far from accurate in predicting how helpful a review is. First, most existing works lack compelling comparisons as many studies are conducted on datasets that are not publicly available. As a consequence, new studies are not always built on top of prior baselines. Second, most existing research focuses only on features derived from the review text, ignoring other fundamental aspects of the review platforms (e.g., the other reviews of a product, the order in which they were submitted). In this paper, we first carefully review the most relevant works in the area published during the last 20 years. We then propose the User-Review-Item (URI) paradigm, a novel abstraction for modeling the problem that moves the focus of the feature engineering from the review to the platform level. We empirically validate the URI paradigm on a dataset of products from six Amazon categories with 270 trained models: on average, classifiers gain +4% in F1-score when considering the whole review platform context. In our experiments, we further emphasize some problems with the helpfulness prediction task: (1) the users’ writing style changes over time (i.e., concept drift), (2) past models do not generalize well across different review categories, and (3) past methods to generate the ground-truth produced unreliable helpfulness scores, affecting the model evaluation phase.
评论平台是一种病毒式的在线服务,用户可以在这里分享和阅读对产品(如智能手机)或体验(如餐厅用餐)的看法。其他用户在决定购买什么时可能会受到这些意见的影响。评论平台的可用性目前受到许多产品的大量意见的限制。因此,只显示每种产品最有用的评论符合用户和平台(例如亚马逊)的最大利益。目前的技术水平在预测综述的帮助方面还远远不够准确。首先,大多数现有作品缺乏令人信服的比较,因为许多研究都是在未公开的数据集上进行的。因此,新的研究并不总是建立在先前的基线之上。其次,大多数现有研究只关注评论文本中的特征,而忽略了评论平台的其他基本方面(例如,产品的其他评论、提交顺序)。在本文中,我们首先仔细回顾了过去20年中发表的该领域最相关的作品。然后,我们提出了用户评审项目(URI)范式,这是一种用于建模问题的新颖抽象,将功能工程的重点从评审转移到平台级别。我们在六个亚马逊类别的产品数据集上用270个经过训练的模型实证验证了URI范式:在考虑整个评论平台上下文时,分类器的F1得分平均为+4%。在我们的实验中,我们进一步强调了有用性预测任务的一些问题:(1)用户的写作风格随着时间的推移而变化(即概念漂移),(2)过去的模型在不同的评论类别中不能很好地概括,(3)过去生成基本事实的方法产生了不可靠的有用性得分,影响了模型评估阶段。
{"title":"A Novel Review Helpfulness Measure based on the User-Review-Item Paradigm","authors":"Luca Pajola, Dongkai Chen, M. Conti, V. S. Subrahmanian","doi":"10.1145/3585280","DOIUrl":"https://doi.org/10.1145/3585280","url":null,"abstract":"Review platforms are viral online services where users share and read opinions about products (e.g., a smartphone) or experiences (e.g., a meal at a restaurant). Other users may be influenced by such opinions when making deciding what to buy. The usability of review platforms is currently limited by the massive number of opinions on many products. Therefore, showing only the most helpful reviews for each product is in the best interests of both users and the platform (e.g., Amazon). The current state of the art is far from accurate in predicting how helpful a review is. First, most existing works lack compelling comparisons as many studies are conducted on datasets that are not publicly available. As a consequence, new studies are not always built on top of prior baselines. Second, most existing research focuses only on features derived from the review text, ignoring other fundamental aspects of the review platforms (e.g., the other reviews of a product, the order in which they were submitted). In this paper, we first carefully review the most relevant works in the area published during the last 20 years. We then propose the User-Review-Item (URI) paradigm, a novel abstraction for modeling the problem that moves the focus of the feature engineering from the review to the platform level. We empirically validate the URI paradigm on a dataset of products from six Amazon categories with 270 trained models: on average, classifiers gain +4% in F1-score when considering the whole review platform context. In our experiments, we further emphasize some problems with the helpfulness prediction task: (1) the users’ writing style changes over time (i.e., concept drift), (2) past models do not generalize well across different review categories, and (3) past methods to generate the ground-truth produced unreliable helpfulness scores, affecting the model evaluation phase.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44921832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Enhancing Conversational Recommendation Systems with Representation Fusion 用表示融合增强会话推荐系统
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-02-21 DOI: https://dl.acm.org/doi/10.1145/3577034
Yingxu Wang, Xiaoru Chen, Jinyuan Fang, Zaiqiao Meng, Shangsong Liang

Conversational Recommendation Systems (CRSs) aim to improve recommendation performance by utilizing information from a conversation session. A CRS first constructs questions and then asks users for their feedback in each conversation session to refine better recommendation lists to users. The key design of CRS is to construct proper questions and obtain users’ feedback in response to these questions so as to effectively capture user preferences. Many CRS works have been proposed; however, they suffer from defects when constructing questions for users to answer: (1) employing a dialogue policy agent for constructing questions is one of the most common choices in CRS, but it needs to be trained with a huge corpus, and (2) it is not appropriate that constructing questions from a single policy (e.g., a CRS only selects attributes that the user has interacted with) for all users with different preferences. To address these defects, we propose a novel CRS model, namely a Representation Fusion–based Conversational Recommendation model, where the whole conversation session is divided into two subsessions (i.e., Local Question Search subsession and Global Question Search subsession) and two different question search methods are proposed to construct questions in the corresponding subsessions without employing policy agents. In particular, in the Local Question Search subsession we adopt a novel graph mining method to find questions, where the paths in the graph between users and attributes can eliminate irrelevant attributes; in the Global Question Search subsession we propose to initialize user preference on items with the user and all item historical rating records and construct questions based on user’s preference. Then, we update the embeddings independently over the two subsessions according to user’s feedback and fuse the final embeddings from the two subsessions for the recommendation. Experiments on three real-world recommendation datasets demonstrate that our proposed method outperforms five state-of-the-art baselines.

会话推荐系统(CRSs)旨在通过利用会话会话中的信息来提高推荐性能。CRS首先构建问题,然后在每个会话会话中询问用户的反馈,以便为用户优化更好的推荐列表。CRS设计的关键是构建合适的问题,并获取用户对这些问题的反馈,从而有效地捕捉用户偏好。许多CRS工程已被提出;然而,它们在构造供用户回答的问题时存在缺陷:(1)使用对话策略代理构造问题是CRS中最常见的选择之一,但需要使用庞大的语料库进行训练;(2)对于所有具有不同偏好的用户,从单一策略构造问题(例如,CRS只选择用户与之交互的属性)是不合适的。为了解决这些问题,我们提出了一种新的CRS模型,即基于表示融合的会话推荐模型,该模型将整个会话划分为两个子会话(即局部问题搜索子会话和全局问题搜索子会话),并提出了两种不同的问题搜索方法,在不使用策略代理的情况下在相应的子会话中构造问题。特别是在局部问题搜索子会话中,我们采用了一种新颖的图挖掘方法来查找问题,其中图中用户和属性之间的路径可以消除不相关的属性;在全局问题搜索子会话中,我们建议使用用户和所有项目的历史评分记录初始化用户对项目的偏好,并根据用户的偏好构造问题。然后,我们根据用户的反馈在两个子会话上独立更新嵌入,并融合两个子会话的最终嵌入用于推荐。在三个真实世界推荐数据集上的实验表明,我们提出的方法优于五个最先进的基线。
{"title":"Enhancing Conversational Recommendation Systems with Representation Fusion","authors":"Yingxu Wang, Xiaoru Chen, Jinyuan Fang, Zaiqiao Meng, Shangsong Liang","doi":"https://dl.acm.org/doi/10.1145/3577034","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577034","url":null,"abstract":"<p>Conversational Recommendation Systems (CRSs) aim to improve recommendation performance by utilizing information from a conversation session. A CRS first constructs questions and then asks users for their feedback in each conversation session to refine better recommendation lists to users. The key design of CRS is to construct proper questions and obtain users’ feedback in response to these questions so as to effectively capture user preferences. Many CRS works have been proposed; however, they suffer from defects when constructing questions for users to answer: (1) employing a dialogue policy agent for constructing questions is one of the most common choices in CRS, but it needs to be trained with a huge corpus, and (2) it is not appropriate that constructing questions from a single policy (e.g., a CRS only selects attributes that the user has interacted with) for all users with different preferences. To address these defects, we propose a novel CRS model, namely a Representation Fusion–based Conversational Recommendation model, where the whole conversation session is divided into two subsessions (i.e., Local Question Search subsession and Global Question Search subsession) and two different question search methods are proposed to construct questions in the corresponding subsessions without employing policy agents. In particular, in the Local Question Search subsession we adopt a novel graph mining method to find questions, where the paths in the graph between users and attributes can eliminate irrelevant attributes; in the Global Question Search subsession we propose to initialize user preference on items with the user and all item historical rating records and construct questions based on user’s preference. Then, we update the embeddings independently over the two subsessions according to user’s feedback and fuse the final embeddings from the two subsessions for the recommendation. Experiments on three real-world recommendation datasets demonstrate that our proposed method outperforms five state-of-the-art baselines.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 31","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning Neighbor User Intention on User-Item Interaction Graphs for Better Sequential Recommendation 在用户-项目交互图上学习邻居用户意图,以获得更好的顺序推荐
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-02-01 DOI: https://dl.acm.org/doi/10.1145/3580520
Mei Yu, Kun Zhu, Mankun Zhao, Jian Yu, Tianyi Xu, Di Jin, Xuewei Li, Ruiguo Yu

The task of Sequential Recommendation aims to predict the user’s preference by analyzing the user’s historical behaviours. Existing methods model item transitions through leveraging sequential patterns. However, they mainly consider the target user’s own behaviours and dynamic characteristics, while often ignore the high-order collaborative connections when modelling user preferences. Some recent works try to use graph-based methods to introduce high-order collaborative signals for Sequential Recommendation, but they have two main problems. One is that the sequential patterns cannot be effectively mined, and the other is that their way of introducing high-order collaborative signals is not very suitable for Sequential Recommendation. To address these problems, we propose to fully exploit sequence features and model high-order collaborative signals for Sequential Recommendation. We propose a Neighbor user Intention based Sequential Recommender, namely NISRec, which utilizes the intentions of high-order connected neighbor users as high-order collaborative signals, in order to improve recommendation performance for the target user. To be specific, NISRec contains two main modules: the neighbor user intention embedding module (NIE) and the fusion module. The NIE describes both the long-term and the short-term intentions of neighbor users and aggregates them separately. The fusion module uses these two types of aggregated intentions to model high-order collaborative signals in both the embedding process and the user preference modelling phase for recommendation of the target user. Experimental results show that our new approach outperforms the state-of-the-art methods on both sparse and dense datasets. Extensive studies further show the effectiveness of the diverse neighbor intentions introduced by NISRec.

顺序推荐的任务是通过分析用户的历史行为来预测用户的偏好。现有方法通过利用顺序模式对项目转换进行建模。然而,他们在建模用户偏好时主要考虑目标用户自身的行为和动态特征,而往往忽略了高阶协作连接。最近的一些研究尝试使用基于图的方法为顺序推荐引入高阶协作信号,但它们存在两个主要问题。一是序列模式不能有效挖掘,二是它们引入高阶协同信号的方式不太适合序列推荐。为了解决这些问题,我们提出充分利用序列特征,对序列推荐的高阶协同信号进行建模。为了提高目标用户的推荐性能,我们提出了一种基于邻居用户意向的顺序推荐器,即NISRec,它利用高阶连接邻居用户的意向作为高阶协同信号。NISRec包含两个主要模块:邻居用户意图嵌入模块(NIE)和融合模块(fusion module)。NIE同时描述邻居用户的长期意图和短期意图,并分别进行聚合。融合模块使用这两种类型的聚合意图在嵌入过程和用户偏好建模阶段对高阶协作信号进行建模,以推荐目标用户。实验结果表明,我们的新方法在稀疏和密集数据集上都优于最先进的方法。大量的研究进一步证明了NISRec引入的多样化邻居意图的有效性。
{"title":"Learning Neighbor User Intention on User-Item Interaction Graphs for Better Sequential Recommendation","authors":"Mei Yu, Kun Zhu, Mankun Zhao, Jian Yu, Tianyi Xu, Di Jin, Xuewei Li, Ruiguo Yu","doi":"https://dl.acm.org/doi/10.1145/3580520","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3580520","url":null,"abstract":"<p>The task of Sequential Recommendation aims to predict the user’s preference by analyzing the user’s historical behaviours. Existing methods model item transitions through leveraging sequential patterns. However, they mainly consider the target user’s own behaviours and dynamic characteristics, while often ignore the high-order collaborative connections when modelling user preferences. Some recent works try to use graph-based methods to introduce high-order collaborative signals for Sequential Recommendation, but they have two main problems. One is that the sequential patterns cannot be effectively mined, and the other is that their way of introducing high-order collaborative signals is not very suitable for Sequential Recommendation. To address these problems, we propose to fully exploit sequence features and model high-order collaborative signals for Sequential Recommendation. We propose a <b>N</b>eighbor user <b>I</b>ntention based <b>S</b>equential <b>Rec</b>ommender, namely NISRec, which utilizes the intentions of high-order connected neighbor users as high-order collaborative signals, in order to improve recommendation performance for the target user. To be specific, NISRec contains two main modules: the neighbor user intention embedding module (NIE) and the fusion module. The NIE describes both the long-term and the short-term intentions of neighbor users and aggregates them separately. The fusion module uses these two types of aggregated intentions to model high-order collaborative signals in both the embedding process and the user preference modelling phase for recommendation of the target user. Experimental results show that our new approach outperforms the state-of-the-art methods on both sparse and dense datasets. Extensive studies further show the effectiveness of the diverse neighbor intentions introduced by NISRec.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"45 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138516923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
ACM Transactions on 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