首页 > 最新文献

ACM Transactions on the Web最新文献

英文 中文
Summarizing Web Archive Corpora Via Social Media Storytelling By Automatically Selecting and Visualizing Exemplars 通过自动选择和可视化示例的社交媒体故事讲述总结网络档案公司
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-07-03 DOI: 10.1145/3606030
Shawn M. Jones, Martin Klein, M. Weigle, Michael L. Nelson
People often create themed collections to make sense of an ever-increasing number of archived web pages. Some of these collections contain hundreds of thousands of documents. Thousands of collections exist, many covering the same topic. Few collections include standardized metadata. This scale makes understanding a collection an expensive proposition. Our Dark and Stormy Archives (DSA) five-process model implements a novel summarization method to help users understand a collection by combining web archives and social media storytelling. The five processes of the DSA model are: select exemplars, generate story metadata, generate document metadata, visualize the story, and distribute the story. Selecting exemplars produces a set of k documents from the N documents in the collection, where k <
人们经常创建主题集合,以使越来越多的存档网页变得有意义。其中一些藏品包含数十万份文件。成千上万的集合存在,许多涵盖相同的主题。很少有集合包含标准化的元数据。这种规模使得理解一个集合成为一个昂贵的命题。我们的黑暗和风暴档案(DSA)五过程模型实现了一种新颖的总结方法,通过结合网络档案和社交媒体故事来帮助用户理解藏品。DSA模型的五个过程是:选择范例、生成故事元数据、生成文档元数据、可视化故事和分发故事。选择范例会从集合中的N个文档中生成一组k个文档,其中k <
{"title":"Summarizing Web Archive Corpora Via Social Media Storytelling By Automatically Selecting and Visualizing Exemplars","authors":"Shawn M. Jones, Martin Klein, M. Weigle, Michael L. Nelson","doi":"10.1145/3606030","DOIUrl":"https://doi.org/10.1145/3606030","url":null,"abstract":"People often create themed collections to make sense of an ever-increasing number of archived web pages. Some of these collections contain hundreds of thousands of documents. Thousands of collections exist, many covering the same topic. Few collections include standardized metadata. This scale makes understanding a collection an expensive proposition. Our Dark and Stormy Archives (DSA) five-process model implements a novel summarization method to help users understand a collection by combining web archives and social media storytelling. The five processes of the DSA model are: select exemplars, generate story metadata, generate document metadata, visualize the story, and distribute the story. Selecting exemplars produces a set of k documents from the N documents in the collection, where k < <N, thus reducing the number of documents visitors need to review to understand a collection. Generating story and document metadata selects images, titles, descriptions, and other content from these exemplars. Visualizing the story ties this metadata together in a format the visitor can consume. Without distributing the story, it is not shared for others to consume. We present a research study demonstrating that our algorithmic primitives can be combined to select relevant exemplars that are otherwise undiscoverable using a conventional search engine and query generation methods. Having demonstrated improved methods for selecting exemplars, we visualize the story. Previous work established that the social card is the best format for visitors to consume surrogates. The social card combines metadata fields, including the document’s title, a brief description, and a striking image. Social cards are commonly found on social media platforms. We discovered that these platforms perform poorly for mementos and rely on web page authors to supply the necessary values for these metadata fields. With web archives, we often encounter archived web pages that predate the existence of this metadata. To generate this missing metadata and ensure that storytelling is available for these documents, we apply machine learning to generate the images needed for social cards with a Precision@1 of 0.8314. We also provide the length values needed for executing automatic summarization algorithms to generate document descriptions. Applying these concepts helps us create the visualizations needed to fulfill the final processes of story generation. We close this work with examples and applications of this technology.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44113678","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
Pre-Training Across Different Cities for Next POI Recommendation 为下一个POI推荐在不同城市进行预培训
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-20 DOI: https://dl.acm.org/doi/10.1145/3605554
Ke Sun, Tieyun Qian, Chenliang Li, Xuan Ma, Qing Li, Ming Zhong, Yuanyuan Zhu, Mengchi Liu

The Point-of-Interest (POI) transition behaviors could hold absolute sparsity and relative sparsity very differently for different cities. Hence, it is intuitive to transfer knowledge across cities to alleviate those data sparsity and imbalance problems for next POI recommendation. Recently, pre-training over a large-scale dataset has achieved great success in many relevant fields, like computer vision and natural language processing. By devising various self-supervised objectives, pre-training models can produce more robust representations for downstream tasks. However, it is not trivial to directly adopt such existing pre-training techniques for next POI recommendation, due to the lacking of common semantic objects (users or items) across different cities. Thus in this paper, we tackle such a new research problem of pre-training across different cities for next POI recommendation. Specifically, to overcome the key challenge that different cities do not share any common object, we propose a novel pre-training model named CATUS, by transferring the category-level universal transition knowledge over different cities. Firstly, we build two self-supervised objectives in CATUS: next category prediction and next POI prediction, to obtain the universal transition-knowledge across different cities and POIs. Then, we design a category-transition oriented sampler on the data level and an implicit and explicit transfer strategy on the encoder level to enhance this transfer process. At the fine-tuning stage, we propose a distance oriented sampler to better align the POI representations into the local context of each city. Extensive experiments on two large datasets consisting of four cities demonstrate the superiority of our proposed CATUS over the state-of-the-art alternatives. The code and datasets are available at https://github.com/NLPWM-WHU/CATUS.

不同城市的兴趣点(Point-of-Interest, POI)转换行为具有不同的绝对稀疏性和相对稀疏性。因此,通过跨城市的知识转移来缓解这些数据稀疏性和不平衡问题是很直观的,可以为下一个POI推荐提供帮助。近年来,基于大规模数据集的预训练在计算机视觉和自然语言处理等相关领域取得了巨大的成功。通过设计各种自监督目标,预训练模型可以为下游任务产生更鲁棒的表示。然而,由于缺乏跨不同城市的共同语义对象(用户或项目),直接采用这种现有的预训练技术进行下一个POI推荐并非易事。因此,在本文中,我们解决了这样一个新的研究问题:跨城市的预训练,为下一个POI推荐。具体而言,为了克服不同城市不共享任何共同对象的关键挑战,我们提出了一种新的预训练模型CATUS,该模型通过在不同城市之间转移类别级别的普遍过渡知识。首先,我们在CATUS中建立两个自监督目标:下一个类别预测和下一个POI预测,以获得跨不同城市和POI的通用过渡知识。然后,我们在数据层设计了面向类别迁移的采样器,在编码器层设计了隐式和显式迁移策略来增强这一迁移过程。在微调阶段,我们提出了一个面向距离的采样器,以更好地将POI表示与每个城市的当地环境结合起来。在由四个城市组成的两个大型数据集上进行的广泛实验表明,我们提出的CATUS优于最先进的替代方案。代码和数据集可在https://github.com/NLPWM-WHU/CATUS上获得。
{"title":"Pre-Training Across Different Cities for Next POI Recommendation","authors":"Ke Sun, Tieyun Qian, Chenliang Li, Xuan Ma, Qing Li, Ming Zhong, Yuanyuan Zhu, Mengchi Liu","doi":"https://dl.acm.org/doi/10.1145/3605554","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3605554","url":null,"abstract":"<p>The Point-of-Interest (POI) transition behaviors could hold absolute sparsity and relative sparsity very differently for different cities. Hence, it is intuitive to transfer knowledge across cities to alleviate those data sparsity and imbalance problems for next POI recommendation. Recently, pre-training over a large-scale dataset has achieved great success in many relevant fields, like computer vision and natural language processing. By devising various self-supervised objectives, pre-training models can produce more robust representations for downstream tasks. However, it is not trivial to directly adopt such existing pre-training techniques for next POI recommendation, due to the <i>lacking of common semantic objects (users or items) across different cities</i>. Thus in this paper, we tackle such a new research problem of <i>pre-training across different cities</i> for next POI recommendation. Specifically, to overcome the key challenge that different cities do not share any common object, we propose a novel pre-training model named <span>CATUS</span>, by transferring the <b>cat</b>egory-level <b>u</b>niversal tran<b>s</b>ition knowledge over different cities. Firstly, we build two self-supervised objectives in <span>CATUS</span>: <i>next category prediction</i> and <i>next POI prediction</i>, to obtain the universal transition-knowledge across different cities and POIs. Then, we design a <i>category-transition oriented sampler</i> on the data level and an <i>implicit and explicit transfer strategy</i> on the encoder level to enhance this transfer process. At the fine-tuning stage, we propose a <i>distance oriented sampler</i> to better align the POI representations into the local context of each city. Extensive experiments on two large datasets consisting of four cities demonstrate the superiority of our proposed <span>CATUS</span> over the state-of-the-art alternatives. The code and datasets are available at https://github.com/NLPWM-WHU/CATUS.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"12 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138516937","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
Pre-Training Across Different Cities for Next POI Recommendation 为下一个POI推荐在不同城市进行预培训
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-20 DOI: 10.1145/3605554
K. Sun, T. Qian, Chenliang Li, Xuan Ma, Qing Li, Ming Zhong, Yuanyuan Zhu, Mengchi Liu
The Point-of-Interest (POI) transition behaviors could hold absolute sparsity and relative sparsity very differently for different cities. Hence, it is intuitive to transfer knowledge across cities to alleviate those data sparsity and imbalance problems for next POI recommendation. Recently, pre-training over a large-scale dataset has achieved great success in many relevant fields, like computer vision and natural language processing. By devising various self-supervised objectives, pre-training models can produce more robust representations for downstream tasks. However, it is not trivial to directly adopt such existing pre-training techniques for next POI recommendation, due to the lacking of common semantic objects (users or items) across different cities. Thus in this paper, we tackle such a new research problem of pre-training across different cities for next POI recommendation. Specifically, to overcome the key challenge that different cities do not share any common object, we propose a novel pre-training model named CATUS, by transferring the category-level universal transition knowledge over different cities. Firstly, we build two self-supervised objectives in CATUS: next category prediction and next POI prediction, to obtain the universal transition-knowledge across different cities and POIs. Then, we design a category-transition oriented sampler on the data level and an implicit and explicit transfer strategy on the encoder level to enhance this transfer process. At the fine-tuning stage, we propose a distance oriented sampler to better align the POI representations into the local context of each city. Extensive experiments on two large datasets consisting of four cities demonstrate the superiority of our proposed CATUS over the state-of-the-art alternatives. The code and datasets are available at https://github.com/NLPWM-WHU/CATUS.
不同城市的兴趣点(Point-of-Interest, POI)转换行为具有不同的绝对稀疏性和相对稀疏性。因此,通过跨城市的知识转移来缓解这些数据稀疏性和不平衡问题是很直观的,可以为下一个POI推荐提供帮助。近年来,基于大规模数据集的预训练在计算机视觉和自然语言处理等相关领域取得了巨大的成功。通过设计各种自监督目标,预训练模型可以为下游任务产生更鲁棒的表示。然而,由于缺乏跨不同城市的共同语义对象(用户或项目),直接采用这种现有的预训练技术进行下一个POI推荐并非易事。因此,在本文中,我们解决了这样一个新的研究问题:跨城市的预训练,为下一个POI推荐。具体而言,为了克服不同城市不共享任何共同对象的关键挑战,我们提出了一种新的预训练模型CATUS,该模型通过在不同城市之间转移类别级别的普遍过渡知识。首先,我们在CATUS中建立两个自监督目标:下一个类别预测和下一个POI预测,以获得跨不同城市和POI的通用过渡知识。然后,我们在数据层设计了面向类别迁移的采样器,在编码器层设计了隐式和显式迁移策略来增强这一迁移过程。在微调阶段,我们提出了一个面向距离的采样器,以更好地将POI表示与每个城市的当地环境结合起来。在由四个城市组成的两个大型数据集上进行的广泛实验表明,我们提出的CATUS优于最先进的替代方案。代码和数据集可在https://github.com/NLPWM-WHU/CATUS上获得。
{"title":"Pre-Training Across Different Cities for Next POI Recommendation","authors":"K. Sun, T. Qian, Chenliang Li, Xuan Ma, Qing Li, Ming Zhong, Yuanyuan Zhu, Mengchi Liu","doi":"10.1145/3605554","DOIUrl":"https://doi.org/10.1145/3605554","url":null,"abstract":"The Point-of-Interest (POI) transition behaviors could hold absolute sparsity and relative sparsity very differently for different cities. Hence, it is intuitive to transfer knowledge across cities to alleviate those data sparsity and imbalance problems for next POI recommendation. Recently, pre-training over a large-scale dataset has achieved great success in many relevant fields, like computer vision and natural language processing. By devising various self-supervised objectives, pre-training models can produce more robust representations for downstream tasks. However, it is not trivial to directly adopt such existing pre-training techniques for next POI recommendation, due to the lacking of common semantic objects (users or items) across different cities. Thus in this paper, we tackle such a new research problem of pre-training across different cities for next POI recommendation. Specifically, to overcome the key challenge that different cities do not share any common object, we propose a novel pre-training model named CATUS, by transferring the category-level universal transition knowledge over different cities. Firstly, we build two self-supervised objectives in CATUS: next category prediction and next POI prediction, to obtain the universal transition-knowledge across different cities and POIs. Then, we design a category-transition oriented sampler on the data level and an implicit and explicit transfer strategy on the encoder level to enhance this transfer process. At the fine-tuning stage, we propose a distance oriented sampler to better align the POI representations into the local context of each city. Extensive experiments on two large datasets consisting of four cities demonstrate the superiority of our proposed CATUS over the state-of-the-art alternatives. The code and datasets are available at https://github.com/NLPWM-WHU/CATUS.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47846112","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
Privacy Scoring Over OSNs: Shared Data Granularity as a Latent Dimension 基于osn的隐私评分:作为潜在维度的共享数据粒度
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-17 DOI: 10.1145/3604909
Yasir Kilic, Ali Inan
Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.
隐私评分旨在基于用户的OSN个人资料页面中共享的属性值和用户在网络中的位置,测量用户在在线社交网络(OSN)上的隐私侵犯风险。现有的隐私评分研究依赖于可能存在偏见或情绪化的调查数据。在这项研究中,我们使用了从专业的领英OSN收集的真实世界数据,并表明从项目反应理论(IRT)导出的概率评分模型比天真的方法更适合真实世界的数据。我们还介绍了OSN用户在其个人资料上共享的数据粒度,作为OSN隐私评分问题的潜在维度。将数据粒度纳入我们的模型中,我们为OSN隐私评分问题构建了最全面的解决方案。对各种评分模型的广泛实验评估表明了所提出的解决方案的有效性。
{"title":"Privacy Scoring Over OSNs: Shared Data Granularity as a Latent Dimension","authors":"Yasir Kilic, Ali Inan","doi":"10.1145/3604909","DOIUrl":"https://doi.org/10.1145/3604909","url":null,"abstract":"Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49275997","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
Layout Cross-Browser Failure Classification for Mobile Responsive Design Web Applications: Combining Classification Models Using Feature Selection 移动响应设计Web应用程序的布局跨浏览器故障分类:使用特征选择组合分类模型
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-17 DOI: 10.1145/3580518
Willian Massami Watanabe, Danilo Alves dos Santos, Claiton de Oliveira
Cross-Browser Incompatibilities - XBIs are defined as inconsistencies that can be observed in Web applications when they are rendered in a specific browser compared to others. These inconsistencies are associated with differences in the way each browser implements their capabilities and render Web applications. The inconsistencies range from minor layout differences to lack of core functionalities of Web applications when rendered in specific browsers. The state-of-the-art proposes different approaches for detecting XBIs and many of them are based on classification models, using features extracted from the DOM-structure (DOM-based approaches) and screenshots (computer vision approaches) of Web applications. A comparison between both DOM-based and computer vision classification models has not been previously reported in the literature and a combination between both approaches could possibly lead to increased accuracy of classification models. In this paper, we extend the use of these classification models for detecting Layout XBIs in Responsive Design Web applications, rendered on different browser viewport widths and devices (iPhone 12 mini, iPhone 12, iPhone 12 PRO MAX and Pixel XL). We investigate the use of state-of-the-art classification models (Browserbite, Crosscheck and our previous work) for detecting Layout Cross-Browser Failures, which consist of Layout XBIs which negatively affect the layout of Responsive Design Web applications. Furthermore, we propose an enhanced classification model which combines features from different state-of-the-art classification models (DOM-based and computer vision), using Feature Selection. We built two datasets for evaluating the efficacy of classification models in separately detecting External and Internal Layout failures, using data from 72 Responsive design Web applications. The proposed classification model reported the highest F1-Score for detecting External Layout Failures (0.65) and Internal Layout Failures (0.35), and these results reported significant differences compared to Browserbite and Crosscheck classification models. Nevertheless, the experiment showed a lower accuracy in the classification of Internal Layout Failures and suggest the use of other image similarity metrics or Deep Learning models for increasing the efficacy of classification models.
跨浏览器不兼容-XBI被定义为当在特定浏览器中呈现时,与其他浏览器相比,可以在Web应用程序中观察到的不一致。这些不一致性与每个浏览器实现其功能和呈现Web应用程序的方式的差异有关。不一致之处包括布局上的细微差异,以及在特定浏览器中呈现时缺乏Web应用程序的核心功能。现有技术提出了检测XBI的不同方法,其中许多方法基于分类模型,使用从Web应用程序的DOM结构(基于DOM的方法)和屏幕截图(计算机视觉方法)中提取的特征。以前文献中没有报道过基于DOM和计算机视觉分类模型之间的比较,两种方法的结合可能会提高分类模型的准确性。在本文中,我们扩展了这些分类模型在响应式设计Web应用程序中检测布局XBI的使用,这些应用程序在不同浏览器视口宽度和设备(iPhone 12 mini、iPhone 12、iPhone 12 PRO MAX和Pixel XL)上渲染。我们研究了使用最先进的分类模型(Browserbite、Crosscheck和我们以前的工作)来检测布局跨浏览器故障,这些模型由对响应设计Web应用程序的布局产生负面影响的布局XBI组成。此外,我们提出了一种增强的分类模型,该模型使用特征选择,结合了来自不同最先进分类模型(基于DOM和计算机视觉)的特征。我们使用72个响应式设计Web应用程序的数据,构建了两个数据集,用于评估分类模型在分别检测外部和内部布局故障方面的功效。所提出的分类模型在检测外部布局故障(0.65)和内部布局故障(0.35)方面报告了最高的F1分数,并且这些结果报告了与Browserbite和Crosscheck分类模型相比的显著差异。然而,该实验显示,内部布局故障的分类精度较低,并建议使用其他图像相似性度量或深度学习模型来提高分类模型的有效性。
{"title":"Layout Cross-Browser Failure Classification for Mobile Responsive Design Web Applications: Combining Classification Models Using Feature Selection","authors":"Willian Massami Watanabe, Danilo Alves dos Santos, Claiton de Oliveira","doi":"10.1145/3580518","DOIUrl":"https://doi.org/10.1145/3580518","url":null,"abstract":"Cross-Browser Incompatibilities - XBIs are defined as inconsistencies that can be observed in Web applications when they are rendered in a specific browser compared to others. These inconsistencies are associated with differences in the way each browser implements their capabilities and render Web applications. The inconsistencies range from minor layout differences to lack of core functionalities of Web applications when rendered in specific browsers. The state-of-the-art proposes different approaches for detecting XBIs and many of them are based on classification models, using features extracted from the DOM-structure (DOM-based approaches) and screenshots (computer vision approaches) of Web applications. A comparison between both DOM-based and computer vision classification models has not been previously reported in the literature and a combination between both approaches could possibly lead to increased accuracy of classification models. In this paper, we extend the use of these classification models for detecting Layout XBIs in Responsive Design Web applications, rendered on different browser viewport widths and devices (iPhone 12 mini, iPhone 12, iPhone 12 PRO MAX and Pixel XL). We investigate the use of state-of-the-art classification models (Browserbite, Crosscheck and our previous work) for detecting Layout Cross-Browser Failures, which consist of Layout XBIs which negatively affect the layout of Responsive Design Web applications. Furthermore, we propose an enhanced classification model which combines features from different state-of-the-art classification models (DOM-based and computer vision), using Feature Selection. We built two datasets for evaluating the efficacy of classification models in separately detecting External and Internal Layout failures, using data from 72 Responsive design Web applications. The proposed classification model reported the highest F1-Score for detecting External Layout Failures (0.65) and Internal Layout Failures (0.35), and these results reported significant differences compared to Browserbite and Crosscheck classification models. Nevertheless, the experiment showed a lower accuracy in the classification of Internal Layout Failures and suggest the use of other image similarity metrics or Deep Learning models for increasing the efficacy of classification models.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45335033","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
Layout Cross-Browser Failure Classification for Mobile Responsive Design Web Applications: Combining Classification Models Using Feature Selection 移动响应式设计Web应用程序的布局跨浏览器失败分类:结合使用特征选择的分类模型
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-17 DOI: https://dl.acm.org/doi/10.1145/3580518
Willian Massami Watanabe, Danilo Alves dos Santos, Claiton de Oliveira

Cross-Browser Incompatibilities - XBIs are defined as inconsistencies that can be observed in Web applications when they are rendered in a specific browser compared to others. These inconsistencies are associated with differences in the way each browser implements their capabilities and render Web applications. The inconsistencies range from minor layout differences to lack of core functionalities of Web applications when rendered in specific browsers. The state-of-the-art proposes different approaches for detecting XBIs and many of them are based on classification models, using features extracted from the DOM-structure (DOM-based approaches) and screenshots (computer vision approaches) of Web applications. A comparison between both DOM-based and computer vision classification models has not been previously reported in the literature and a combination between both approaches could possibly lead to increased accuracy of classification models. In this paper, we extend the use of these classification models for detecting Layout XBIs in Responsive Design Web applications, rendered on different browser viewport widths and devices (iPhone 12 mini, iPhone 12, iPhone 12 PRO MAX and Pixel XL). We investigate the use of state-of-the-art classification models (Browserbite, Crosscheck and our previous work) for detecting Layout Cross-Browser Failures, which consist of Layout XBIs which negatively affect the layout of Responsive Design Web applications. Furthermore, we propose an enhanced classification model which combines features from different state-of-the-art classification models (DOM-based and computer vision), using Feature Selection. We built two datasets for evaluating the efficacy of classification models in separately detecting External and Internal Layout failures, using data from 72 Responsive design Web applications. The proposed classification model reported the highest F1-Score for detecting External Layout Failures (0.65) and Internal Layout Failures (0.35), and these results reported significant differences compared to Browserbite and Crosscheck classification models. Nevertheless, the experiment showed a lower accuracy in the classification of Internal Layout Failures and suggest the use of other image similarity metrics or Deep Learning models for increasing the efficacy of classification models.

跨浏览器不兼容性——xbi被定义为Web应用程序中与其他浏览器相比在特定浏览器中呈现时可以观察到的不一致性。这些不一致与每个浏览器实现其功能和呈现Web应用程序的方式的差异有关。不一致的范围从较小的布局差异到在特定浏览器中呈现Web应用程序时缺乏核心功能。最新技术提出了检测xbi的不同方法,其中许多方法基于分类模型,使用从Web应用程序的dom结构(基于dom的方法)和屏幕截图(计算机视觉方法)中提取的特征。基于dom和计算机视觉的分类模型之间的比较在以前的文献中没有报道过,两种方法的结合可能会导致分类模型的准确性提高。在本文中,我们扩展了这些分类模型的使用,用于检测响应式设计Web应用程序中的布局xbi,在不同的浏览器视口宽度和设备(iPhone 12 mini, iPhone 12, iPhone 12 PRO MAX和Pixel XL)上呈现。我们研究了使用最先进的分类模型(Browserbite, Crosscheck和我们以前的工作)来检测布局跨浏览器故障,这些故障由布局xbi组成,会对响应式设计Web应用程序的布局产生负面影响。此外,我们提出了一个增强的分类模型,该模型结合了不同的最先进的分类模型(基于dom和计算机视觉)的特征,使用特征选择。我们建立了两个数据集来评估分类模型在分别检测外部和内部布局失败方面的有效性,使用了来自72个响应式设计Web应用程序的数据。该分类模型在检测外部布局错误(0.65)和内部布局错误(0.35)方面的f1得分最高,与Browserbite和Crosscheck分类模型相比差异显著。然而,实验显示内部布局失败分类的准确性较低,并建议使用其他图像相似度度量或深度学习模型来提高分类模型的有效性。
{"title":"Layout Cross-Browser Failure Classification for Mobile Responsive Design Web Applications: Combining Classification Models Using Feature Selection","authors":"Willian Massami Watanabe, Danilo Alves dos Santos, Claiton de Oliveira","doi":"https://dl.acm.org/doi/10.1145/3580518","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3580518","url":null,"abstract":"<p>Cross-Browser Incompatibilities - XBIs are defined as inconsistencies that can be observed in Web applications when they are rendered in a specific browser compared to others. These inconsistencies are associated with differences in the way each browser implements their capabilities and render Web applications. The inconsistencies range from minor layout differences to lack of core functionalities of Web applications when rendered in specific browsers. The state-of-the-art proposes different approaches for detecting XBIs and many of them are based on classification models, using features extracted from the DOM-structure (DOM-based approaches) and screenshots (computer vision approaches) of Web applications. A comparison between both DOM-based and computer vision classification models has not been previously reported in the literature and a combination between both approaches could possibly lead to increased accuracy of classification models. In this paper, we extend the use of these classification models for detecting Layout XBIs in Responsive Design Web applications, rendered on different browser viewport widths and devices (iPhone 12 mini, iPhone 12, iPhone 12 PRO MAX and Pixel XL). We investigate the use of state-of-the-art classification models (Browserbite, Crosscheck and our previous work) for detecting Layout Cross-Browser Failures, which consist of Layout XBIs which negatively affect the layout of Responsive Design Web applications. Furthermore, we propose an enhanced classification model which combines features from different state-of-the-art classification models (DOM-based and computer vision), using Feature Selection. We built two datasets for evaluating the efficacy of classification models in separately detecting External and Internal Layout failures, using data from 72 Responsive design Web applications. The proposed classification model reported the highest F1-Score for detecting External Layout Failures (0.65) and Internal Layout Failures (0.35), and these results reported significant differences compared to Browserbite and Crosscheck classification models. Nevertheless, the experiment showed a lower accuracy in the classification of Internal Layout Failures and suggest the use of other image similarity metrics or Deep Learning models for increasing the efficacy of classification models.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 10","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495150","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
Privacy Scoring Over OSNs: Shared Data Granularity as a Latent Dimension 基于osn的隐私评分:作为潜在维度的共享数据粒度
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-17 DOI: https://dl.acm.org/doi/10.1145/3604909
Yasir Kilic, Ali Inan

Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.

隐私评分是根据用户的OSN配置页面中共享的属性值和用户在网络中的位置,衡量用户在某个OSN (online social network)上隐私被侵犯的风险。现有的隐私评分研究依赖于可能有偏见或情绪化的调查数据。在本研究中,我们使用从专业LinkedIn OSN收集的真实世界数据,并表明从项目反应理论(IRT)衍生的概率评分模型比朴素方法更适合真实世界数据。我们还引入了OSN用户在其个人资料上共享的数据粒度,作为OSN隐私评分问题的潜在维度。将数据粒度整合到我们的模型中,我们构建了最全面的OSN隐私评分问题解决方案。各种评分模型的广泛实验评估表明了所提出的解决方案的有效性。
{"title":"Privacy Scoring Over OSNs: Shared Data Granularity as a Latent Dimension","authors":"Yasir Kilic, Ali Inan","doi":"https://dl.acm.org/doi/10.1145/3604909","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3604909","url":null,"abstract":"<p>Privacy scoring aims at measuring the privacy violation risk of a user over an online social network (OSN) based on attribute values shared in the user’s OSN profile page and the user’s position in the network. Existing studies on privacy scoring rely on possibly biased or emotional survey data. In this study, we work with real-world data collected from the professional LinkedIn OSN and show that probabilistic scoring models derived from the item response theory (IRT) fit real-world data better than naive approaches. We also introduce the granularity of the data an OSN user shares on her profile as a latent dimension of the OSN privacy scoring problem. Incorporating data granularity into our model, we build the most comprehensive solution to the OSN privacy scoring problem. Extensive experimental evaluation of various scoring models indicate the effectiveness of the proposed solution.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 11","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495149","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
Closeness Centrality on Uncertain Graphs 不确定图的贴近度中心性
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-15 DOI: 10.1145/3604912
Zhenfang Liu, Jianxiong Ye, Zhaonian Zou
Centrality is a family of metrics for characterizing the importance of a vertex in a graph. Although a large number of centrality metrics have been proposed, a majority of them ignores uncertainty in graph data. In this paper, we formulate closeness centrality on uncertain graphs and define the batch closeness centrality evaluation problem that computes the closeness centrality of a subset of vertices in an uncertain graph. We develop three algorithms, MS-BCC, MG-BCC and MGMS-BCC, based on sampling to approximate the closeness centrality of the specified vertices. All these algorithms require to perform breadth-first searches (BFS) starting from the specified vertices on a large number of sampled possible worlds of the uncertain graph. To improve the efficiency of the algorithms, we exploit operation-level parallelism of the BFS traversals and simultaneously execute the shared sequences of operations in the breadth-first searches. Parallelization is realized at different levels in these algorithms. The experimental results show that the proposed algorithms can efficiently and accurately approximate the closeness centrality of the given vertices. MGMS-BCC is faster than both MS-BCC and MG-BCC because it avoids more repeated executions of the shared operation sequences in the BFS traversals.
中心性是一组度量,用于表征图中顶点的重要性。尽管已经提出了大量的中心性度量,但大多数度量忽略了图数据中的不确定性。在本文中,我们公式化了不确定图上的贴近度中心性,并定义了批量贴近度中心度评估问题,该问题计算不确定图中顶点子集的贴近度中央性。我们开发了三种算法,MS-BCC、MG-BCC和MGMS-BCC,基于采样来近似指定顶点的接近中心性。所有这些算法都需要在不确定图的大量采样可能世界上从指定的顶点开始执行广度优先搜索(BFS)。为了提高算法的效率,我们利用了BFS遍历的操作级并行性,并在广度优先搜索中同时执行共享的操作序列。这些算法实现了不同层次的并行化。实验结果表明,该算法能够有效、准确地逼近给定顶点的贴近度中心。MGMS-BCC比MS-BCC和MG-BCC都快,因为它避免了BFS遍历中共享操作序列的更多重复执行。
{"title":"Closeness Centrality on Uncertain Graphs","authors":"Zhenfang Liu, Jianxiong Ye, Zhaonian Zou","doi":"10.1145/3604912","DOIUrl":"https://doi.org/10.1145/3604912","url":null,"abstract":"Centrality is a family of metrics for characterizing the importance of a vertex in a graph. Although a large number of centrality metrics have been proposed, a majority of them ignores uncertainty in graph data. In this paper, we formulate closeness centrality on uncertain graphs and define the batch closeness centrality evaluation problem that computes the closeness centrality of a subset of vertices in an uncertain graph. We develop three algorithms, MS-BCC, MG-BCC and MGMS-BCC, based on sampling to approximate the closeness centrality of the specified vertices. All these algorithms require to perform breadth-first searches (BFS) starting from the specified vertices on a large number of sampled possible worlds of the uncertain graph. To improve the efficiency of the algorithms, we exploit operation-level parallelism of the BFS traversals and simultaneously execute the shared sequences of operations in the breadth-first searches. Parallelization is realized at different levels in these algorithms. The experimental results show that the proposed algorithms can efficiently and accurately approximate the closeness centrality of the given vertices. MGMS-BCC is faster than both MS-BCC and MG-BCC because it avoids more repeated executions of the shared operation sequences in the BFS traversals.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48938056","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
Causality and Correlation Graph Modeling for Effective and Explainable Session-based Recommendation 基于会话的有效可解释推荐的因果关系和相关图建模
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-06-05 DOI: https://dl.acm.org/doi/10.1145/3593313
Huizi Wu, Cong Geng, Hui Fang

Session-based recommendation which has been witnessed a booming interest recently, focuses on predicting a user’s next interested item(s) based on an anonymous session. Most existing studies adopt complex deep learning techniques (e.g., graph neural networks) for effective session-based recommendation. However, they merely address co-occurrence between items, but fail to well distinguish causality and correlation relationship. Considering the varied interpretations and characteristics of causality and correlation relationship between items, in this study, we propose a novel method denoted as CGSR by jointly modeling causality and correlation relationship between items. In particular, we construct cause, effect and correlation graphs from sessions by simultaneously considering the false causality problem. We further design a graph neural network-based method for session-based recommendation. To conclude, we strive to explore the relationship between items from specific “causality” (directed) and “correlation” (undirected) perspectives. Extensive experiments on three datasets show that our model outperforms other state-of-the-art methods in terms of recommendation accuracy. Moreover, we further propose an explainable framework on CGSR, and demonstrate the explainability of our model via case studies on Amazon dataset.

基于会话的推荐是一种基于匿名会话预测用户下一个感兴趣的项目的方法,最近引起了人们的极大兴趣。大多数现有的研究采用复杂的深度学习技术(例如,图神经网络)来进行有效的基于会话的推荐。然而,它们只是处理项目之间的共现性,而未能很好地区分因果关系和相关关系。考虑到项目间因果关系和相关关系的不同解释及其特点,本研究提出了一种将项目间因果关系和相关关系联合建模的新方法,即CGSR。特别地,我们通过同时考虑假因果关系问题来构造会话的因果关系图和相关图。我们进一步设计了一种基于图神经网络的会话推荐方法。总之,我们努力从特定的“因果关系”(定向)和“相关性”(无定向)角度探索项目之间的关系。在三个数据集上进行的大量实验表明,我们的模型在推荐精度方面优于其他最先进的方法。此外,我们进一步提出了一个基于CGSR的可解释框架,并通过亚马逊数据集的案例研究证明了模型的可解释性。
{"title":"Causality and Correlation Graph Modeling for Effective and Explainable Session-based Recommendation","authors":"Huizi Wu, Cong Geng, Hui Fang","doi":"https://dl.acm.org/doi/10.1145/3593313","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3593313","url":null,"abstract":"<p>Session-based recommendation which has been witnessed a booming interest recently, focuses on predicting a user’s next interested item(s) based on an anonymous session. Most existing studies adopt complex deep learning techniques (e.g., graph neural networks) for effective session-based recommendation. However, they merely address <i>co-occurrence</i> between items, but fail to well distinguish <i>causality</i> and <i>correlation</i> relationship. Considering the varied interpretations and characteristics of causality and correlation relationship between items, in this study, we propose a novel method denoted as CGSR by jointly modeling causality and correlation relationship between items. In particular, we construct cause, effect and correlation graphs from sessions by simultaneously considering the false causality problem. We further design a graph neural network-based method for session-based recommendation. To conclude, we strive to explore the relationship between items from specific “causality” (directed) and “correlation” (undirected) perspectives. Extensive experiments on three datasets show that our model outperforms other state-of-the-art methods in terms of recommendation accuracy. Moreover, we further propose an explainable framework on CGSR, and demonstrate the explainability of our model via case studies on Amazon dataset.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 12","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495148","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 Multi-Task Graph Neural Network with Variational Graph Auto-Encoders for Session-Based Travel Packages Recommendation 带变分图自编码器的多任务图神经网络用于基于会话的旅游套餐推荐
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-05-24 DOI: https://dl.acm.org/doi/10.1145/3577032
Guixiang Zhu, Jie Cao, Lei Chen, Youquan Wang, Zhan Bu, Shuxin Yang, Jianqing Wu, Zhiping Wang

Session-based travel packages recommendation aims to predict users’ next click based on their current and historical sessions recorded by Online Travel Agencies (OTAs). Recently, an increasing number of studies attempted to apply Graph Neural Networks (GNNs) to the session-based recommendation and obtained promising results. However, most of them do not take full advantage of the explicit latent structure from attributes of items, making learned representations of items less effective and difficult to interpret. Moreover, they only combine historical sessions (long-term preferences) with a current session (short-term preference) to learn a unified representation of users, ignoring the effects of historical sessions for the current session. To this end, this article proposes a novel session-based model named STR-VGAE, which fills subtasks of the travel packages recommendation and variational graph auto-encoders simultaneously. STR-VGAE mainly consists of three components: travel packages encoder, users behaviors encoder, and interaction modeling. Specifically, the travel packages encoder module is used to learn a unified travel package representation from co-occurrence attribute graphs by using multi-view variational graph auto-encoders and a multi-view attention network. The users behaviors encoder module is used to encode user’ historical and current sessions with a personalized GNN, which considers the effects of historical sessions on the current session, and coalesce these two kinds of session representations to learn the high-quality users’ representations by exploiting a gated fusion approach. The interaction modeling module is used to calculate recommendation scores over all candidate travel packages. Extensive experiments on a real-life tourism e-commerce dataset from China show that STR-VGAE yields significant performance advantages over several competitive methods, meanwhile provides an interpretation for the generated recommendation list.

基于会话的旅游套餐推荐旨在根据在线旅行社(ota)记录的用户当前和历史会话来预测用户的下一次点击。近年来,越来越多的研究尝试将图神经网络(GNNs)应用于基于会话的推荐,并取得了可喜的成果。然而,它们大多没有充分利用项目属性的显性潜在结构,使得学习后的项目表征效果不佳,难以解释。此外,它们只将历史会话(长期首选项)与当前会话(短期首选项)结合起来学习用户的统一表示,而忽略了历史会话对当前会话的影响。为此,本文提出了一种新的基于会话的STR-VGAE模型,该模型同时填充了旅游包推荐和变分图自编码器的子任务。STR-VGAE主要由三个部分组成:旅行包编码器、用户行为编码器和交互建模。其中,旅行包编码器模块利用多视图变分图自编码器和多视图关注网络,从共现属性图中学习统一的旅行包表示。用户行为编码器模块使用个性化的GNN对用户的历史会话和当前会话进行编码,该GNN考虑了历史会话对当前会话的影响,并利用门控融合方法将这两种会话表示合并以学习高质量的用户表示。交互建模模块用于计算所有候选旅行包的推荐分数。在中国真实的旅游电子商务数据集上进行的大量实验表明,STR-VGAE比几种竞争方法具有显著的性能优势,同时为生成的推荐列表提供了解释。
{"title":"A Multi-Task Graph Neural Network with Variational Graph Auto-Encoders for Session-Based Travel Packages Recommendation","authors":"Guixiang Zhu, Jie Cao, Lei Chen, Youquan Wang, Zhan Bu, Shuxin Yang, Jianqing Wu, Zhiping Wang","doi":"https://dl.acm.org/doi/10.1145/3577032","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577032","url":null,"abstract":"<p>Session-based travel packages recommendation aims to predict users’ next click based on their current and historical sessions recorded by Online Travel Agencies (OTAs). Recently, an increasing number of studies attempted to apply Graph Neural Networks (GNNs) to the session-based recommendation and obtained promising results. However, most of them do not take full advantage of the explicit latent structure from attributes of items, making learned representations of items less effective and difficult to interpret. Moreover, they only combine historical sessions (long-term preferences) with a current session (short-term preference) to learn a unified representation of users, ignoring the effects of historical sessions for the current session. To this end, this article proposes a novel session-based model named STR-VGAE, which fills subtasks of the travel packages recommendation and variational graph auto-encoders simultaneously. STR-VGAE mainly consists of three components: <i>travel packages encoder</i>, <i>users behaviors encoder</i>, and <i>interaction modeling</i>. Specifically, the <i>travel packages encoder</i> module is used to learn a unified travel package representation from co-occurrence attribute graphs by using multi-view variational graph auto-encoders and a multi-view attention network. The <i>users behaviors encoder</i> module is used to encode user’ historical and current sessions with a personalized GNN, which considers the effects of historical sessions on the current session, and coalesce these two kinds of session representations to learn the high-quality users’ representations by exploiting a gated fusion approach. The <i>interaction modeling</i> module is used to calculate recommendation scores over all candidate travel packages. Extensive experiments on a real-life tourism e-commerce dataset from China show that STR-VGAE yields significant performance advantages over several competitive methods, meanwhile provides an interpretation for the generated recommendation list.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 13","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495147","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