Reviewerly/exHarmony huggingface dataset:
The Influence of Social Stratification on Trust in Recommender Systems

This paper examines the impact of social stratification on trust in recommender systems. Recommender systems have become an essential tool for users to navigate vast amounts of information online, but trust in these systems has become a concern. The focus of this study is to investigate whether social stratification, defined by socioeconomic status, affects trust in recommender systems. We first review the literature on trust in recommender systems and social stratification, highlighting gaps in the current research. We then describe the methodology used in our study, which involves the analysis of valid and consented responses received from 487 participants from different socioeconomic backgrounds, registered in an online survey. This study aimed to investigate the influence of social stratification, specifically income, on trust in recommender systems. Results showed a curvilinear relationship between income and trust in recommender systems, such that moderate income levels were associated with higher levels of trust, while both low- and high-income levels were associated with lower levels of trust. These findings suggest that income plays an important role in shaping users’ trust in recommender systems and highlight the need for future research to examine the complex interplay between social stratification and trust in technology.
Research on Intelligent Digital Management Model of Metropolitan Museum of Art in the Era of “Cloud Exhibition-Visit”

In recent years, affected by the impact of the COVID-19 epidemic, the museum has gradually begun to develop the online exhibition mode, displaying the collection through large-screen simulation, VR and other forms, and gradually forming the era of “cloud exhibition-visit”. That is, you can watch the exhibition without going out. The epidemic situation has made the offline exhibition unable to proceed normally, which has caused an upsurge of online exhibition viewing. This paper analyzes and summarizes the digital management mode of the Metropolitan Museum of Art during the epidemic period, and brings certain reference significance for the development of China's digital intelligent museum under the era of “cloud exhibition-visit”.
Continuous Mixtures of Tractable Probabilistic Models

Probabilistic models based on continuous latent spaces, such as variational autoencoders, can be understood as uncountable mixture models where components depend continuously on the latent code. They have proven to be expressive tools for generative and probabilistic modelling, but are at odds with tractable probabilistic inference, that is, computing marginals and conditionals of the represented probability distribution. Meanwhile, tractable probabilistic models such as probabilistic circuits (PCs) can be understood as hierarchical discrete mixture models, and thus are capable of performing exact inference efficiently but often show subpar performance in comparison to continuous latent-space models. In this paper, we investigate a hybrid approach, namely continuous mixtures of tractable models with a small latent dimension. While these models are analytically intractable, they are well amenable to numerical integration schemes based on a finite set of integration points. With a large enough number of integration points the approximation becomes de-facto exact. Moreover, for a finite set of integration points, the integration method effectively compiles the continuous mixture into a standard PC. In experiments, we show that this simple scheme proves remarkably effective, as PCs learnt this way set new state of the art for tractable models on many standard density estimation benchmarks.
Non-fungible Token (NFT): Introduction, Current Market and Legal Problems

Non-fungible token (NFT) is a unique cryptocurrency based on Ethereum smart contracts, which is used to bind digital assets to prove their ownership. After merging with gaming platforms, luxury goods, sports and art industries, NFTs generate substantial business opportunities, with sales $24.9 billion in 2021. However, the NFT market faces far more challenges than opportunities and is relatively immature. Few studies analyze the current NFT market in detail and comprehensively from multiple angles simultaneously. Therefore, this article first reviews several essential stages in the history of NFT, then focuses on analyzing the current situation of the NFT market from both positive and negative aspects, and finally points out the institutional problems that need to be solved for the further development of the NFT market in the future. Through this research, we found that the NFT market has cooled compared to 2021, but we cannot simply claim that the NFT market is collapsing. At the same time, the lack of supervision and the validity of contracts are stumbling blocks that urgently need to be solved for further development of the NFT market. This article provides an objective, comprehensive analysis of market conditions for newcomers to NFTs and those who want to invest in NFTs, and informs them of potential risks.
Multi-Classifier Adversarial Optimization for Active Learning

Active learning (AL) aims to find a better trade-off between labeling costs and model performance by consciously selecting more informative samples to label. Recently, adversarial approaches have emerged as effective solutions. Most of them leverage generative adversarial networks to align feature distributions of labeled and unlabeled data, upon which discriminators are trained to better distinguish between them. However, these methods fail to consider the relationship between unlabeled samples and decision boundaries, and their training processes are often complex and unstable. To this end, this paper proposes a novel adversarial AL method, namely multi-classifier adversarial optimization for active learning (MAOAL). MAOAL employs task-specific decision boundaries for data alignment while selecting the most informative samples to label. To fulfill this, we introduce a novel classifier class confusion (C3) metric, which represents the classifier discrepancy as the inter-class correlation of classifier outputs. Without any additional hyper-parameters, the C3 metric further reduces the negative impacts of ambiguous samples in the process of distribution alignment and sample selection. More concretely, the network is trained adversarially by adding two auxiliary classifiers, reducing the distribution bias of labeled and unlabeled samples by minimizing the C3 loss between classifiers, while learning tighter decision boundaries and highlighting hard samples by maximizing the C3 loss. Finally, the unlabeled samples with the highest C3 loss are selected to label. Extensive experiments demonstrate the superiority of our approach over state-of-the-art AL methods in terms of image classification and object detection.
Partial-Label Regression

Partial-label learning is a popular weakly supervised learning setting that allows each training example to be annotated with a set of candidate labels. Previous studies on partial-label learning only focused on the classification setting where candidate labels are all discrete, which cannot handle continuous labels with real values. In this paper, we provide the first attempt to investigate partial-label regression, where each training example is annotated with a set of real-valued candidate labels. To solve this problem, we first propose a simple baseline method that takes the average loss incurred by candidate labels as the predictive loss. The drawback of this method lies in that the loss incurred by the true label may be overwhelmed by other false labels. To overcome this drawback, we propose an identification method that takes the least loss incurred by candidate labels as the predictive loss. We further improve it by proposing a progressive identification method to differentiate candidate labels using progressively updated weights for incurred losses. We prove that the latter two methods are model-consistent and provide convergence analysis showing the optimal parametric convergence rate. Our proposed methods are theoretically grounded and can be compatible with any models, optimizers, and losses. Experiments validate the effectiveness of our proposed methods.
Supply Chain Finance and Blockchain Technology

Digital supply chain finance is a financial innovation product of the combination of blockchain technology and traditional supply chain finance. This paper constructs the theoretical framework of enterprise mortgage financing from banks in the supply chain network, and analyzes the economic operation principle of digital supply chain finance and its advantages and disadvantages compared with traditional supply chain finance. In order to prevent ethical risks like enterprise information manipulation and malicious fraud, the study found that when the quantity and quality of information on the supply chain reach certain levels, the enterprise-related information revealed by the blockchain's consensus mechanism will be close to the actual information. This will allow banks to offer sufficient accessibility for supply chain businesses and enough affordable financing options. Banks, on the other hand, are better suited to avoid and control risks through conventional offline due diligence when the number of chain firms is few or the quality of chain information cannot be assured. Theoretically, this paper shows that digital supply chain finance based on blockchain technology will become a more effective and inclusive financial support method in the future with the popularization of blockchain technology in the supply chain and the improvement of enterprise digitization level.
DHGE: Dual-View Hyper-Relational Knowledge Graph Embedding for Link Prediction and Entity Typing

In the field of representation learning on knowledge graphs (KGs), a hyper-relational fact consists of a main triple and several auxiliary attribute-value descriptions, which is considered more comprehensive and specific than a triple-based fact. However, currently available hyper-relational KG embedding methods in a single view are limited in application because they weaken the hierarchical structure that represents the affiliation between entities. To overcome this limitation, we propose a dual-view hyper-relational KG structure (DH-KG) that contains a hyper-relational instance view for entities and a hyper-relational ontology view for concepts that are abstracted hierarchically from the entities. This paper defines link prediction and entity typing tasks on DH-KG for the first time and constructs two DH-KG datasets, JW44K-6K, extracted from Wikidata, and HTDM based on medical data. Furthermore, we propose DHGE, a DH-KG embedding model based on GRAN encoders, HGNNs, and joint learning. DHGE outperforms baseline models on DH-KG, according to experimental results. Finally, we provide an example of how this technology can be used to treat hypertension. Our model and new datasets are publicly available.
Learning from the Wisdom of Crowds: Exploiting Similar Sessions for Session Search

Search engines are essential internet services, enabling users to efficiently find the information they need. Session search employs users’ session logs of queries to solve complex retrieval tasks, in which users search multiple times until interested documents are found. Most existing session search models focus on the contextual information within the current search, ignoring the evidence from historical search sessions. Considering the fact that many ongoing retrieval tasks should have already been carried out by other users with a similar intent, we argue that historical sessions with similar intents can help improve the accuracy of the current search task. We propose a novel Similar Session-enhanced Ranking (SSR) model to improve the session search performance using historical sessions with similar intents. Specifically, the candidate historical sessions are matched by query-level and session-level semantic similarity, and then query-level neighbor behaviors are aggregated by a Query-guided GNN (QGNN) while session-level neighbor behaviors are aggregated using the attention mechanism. Finally, we integrate the refined and aggregated historical neighbor information into the current search session. Experimental results on AOL and Tiangong-ST datasets show that our SSR model significantly outperforms the state-of-the-art models.
Can NFT Refresh the Field of Digital Copyright Protection? The Positive Role and Potential Risks of NFT in Digital Copyright Protection

Digital works refer to works created by means of digital technology and disseminated to the public through the Internet. With the vigorous development of digits, the copyright protection of digital publishing has attracted much attention. Therefore, it is very important to improve the ability of digital copyright protection. The non-fungible token (NFT) may bring a new opportunity for digital copyright protection by virtue of its traceability and non tamperability based on blockchain. In this article, we first discuss how NFT protects copyright and the risks implied therein. Then it gives its application prospect, its application in copyright traceability, and the problem of right confirmation in the future meta universe. Finally, it points out that creators need to pay attention to and generate NFT works as soon as possible to protect their NFT copyright. Platform supervision should formulate appropriate operation rules, and NFT holders should clarify their rights to avoid infringement. NFT is an emerging technology with many uncertainties. In future applications, we should make proper use of NFT technology to make it have a positive impact on our lives.
VisCoMET: Visually Analyzing Team Collaboration in Medical Emergency Trainings

Abstract Handling emergencies requires efficient and effective collaboration of medical professionals. To analyze their performance, in an application study, we have developed VisCoMET, a visual analytics approach displaying interactions of healthcare personnel in a triage training of a mass casualty incident. The application scenario stems from social interaction research, where the collaboration of teams is studied from different perspectives. We integrate recorded annotations from multiple sources, such as recorded videos of the sessions, transcribed communication, and eye‐tracking information. For each session, an information‐rich timeline visualizes events across these different channels, specifically highlighting interactions between the team members. We provide algorithmic support to identify frequent event patterns and to search for user‐defined event sequences. Comparing different teams, an overview visualization aggregates each training session in a visual glyph as a node, connected to similar sessions through edges. An application example shows the usage of the approach in the comparative analysis of triage training sessions, where multiple teams encountered the same scene, and highlights discovered insights. The approach was evaluated through feedback from visualization and social interaction experts. The results show that the approach supports reflecting on teams' performance by exploratory analysis of collaboration behavior while particularly enabling the comparison of triage training sessions.
VISITOR: Visual Interactive State Sequence Exploration for Reinforcement Learning

Abstract Understanding the behavior of deep reinforcement learning agents is a crucial requirement throughout their development. Existing work has addressed the identification of observable behavioral patterns in state sequences or analysis of isolated internal representations; however, the overall decision‐making of deep‐learning RL agents remains opaque. To tackle this, we present VISITOR, a visual analytics system enabling the analysis of entire state sequences, the diagnosis of singular predictions, and the comparison between agents. A sequence embedding view enables the multiscale analysis of state sequences, utilizing custom embedding techniques for a stable spatialization of the observations and internal states. We provide multiple layers: (1) a state space embedding, highlighting different groups of states inside the state‐action sequences, (2) a trajectory view, emphasizing decision points, (3) a network activation mapping, visualizing the relationship between observations and network activations, (4) a transition embedding, enabling the analysis of state‐to‐state transitions. The embedding view is accompanied by an interactive reward view that captures the temporal development of metrics, which can be linked directly to states in the embedding. Lastly, a model list allows for the quick comparison of models across multiple metrics. Annotations can be exported to communicate results to different audiences. Our two‐stage evaluation with eight experts confirms the effectiveness in identifying states of interest, comparing the quality of policies, and reasoning about the internal decision‐making processes.
Unfolding Edges: Adding Context to Edges in Multivariate Graph Visualization

Abstract Existing work on visualizing multivariate graphs is primarily concerned with representing the attributes of nodes. Even though edges are the constitutive elements of networks, there have been only few attempts to visualize attributes of edges. In this work, we focus on the critical importance of edge attributes for interpreting network visualizations and building trust in the underlying data. We propose ‘unfolding of edges’ as an interactive approach to integrate multivariate edge attributes dynamically into existing node‐link diagrams. Unfolding edges is an in‐situ approach that gradually transforms basic links into detailed representations of the associated edge attributes. This approach extends focus+context, semantic zoom, and animated transitions for network visualizations to accommodate edge details on‐demand without cluttering the overall graph layout. We explore the design space for the unfolding of edges, which covers aspects of making space for the unfolding, of actually representing the edge context, and of navigating between edges. To demonstrate the utility of our approach, we present two case studies in the context of historical network analysis and computational social science. For these, web‐based prototypes were implemented based on which we conducted interviews with domain experts. The experts' feedback suggests that the proposed unfolding of edges is a useful tool for exploring rich edge information of multivariate graphs.
Spatiotemporal Deformation Perception for Fisheye Video Rectification

Although the distortion correction of fisheye images has been extensively studied, the correction of fisheye videos is still an elusive challenge. For different frames of the fisheye video, the existing image correction methods ignore the correlation of sequences, resulting in temporal jitter in the corrected video. To solve this problem, we propose a temporal weighting scheme to get a plausible global optical flow, which mitigates the jitter effect by progressively reducing the weight of frames. Subsequently, we observe that the inter-frame optical flow of the video is facilitated to perceive the local spatial deformation of the fisheye video. Therefore, we derive the spatial deformation through the flows of fisheye and distorted-free videos, thereby enhancing the local accuracy of the predicted result. However, the independent correction for each frame disrupts the temporal correlation. Due to the property of fisheye video, a distorted moving object may be able to find its distorted-free pattern at another moment. To this end, a temporal deformation aggregator is designed to reconstruct the deformation correlation between frames and provide a reliable global feature. Our method achieves an end-to-end correction and demonstrates superiority in correction quality and stability compared with the SOTA correction methods.
RectEuler: Visualizing Intersecting Sets using Rectangles

Abstract Euler diagrams are a popular technique to visualize set‐typed data. However, creating diagrams using simple shapes remains a challenging problem for many complex, real‐life datasets. To solve this, we propose RectEuler: a flexible, fully‐automatic method using rectangles to create Euler‐like diagrams. We use an efficient mixed‐integer optimization scheme to place set labels and element representatives (e.g., text or images) in conjunction with rectangles describing the sets. By defining appropriate constraints, we adhere to well‐formedness properties and aesthetic considerations. If a dataset cannot be created within a reasonable time or at all, we iteratively split the diagram into multiple components until a drawable solution is found. Redundant encoding of the set membership using dots and set lines improves the readability of the diagram. Our web tool lets users see how the layout changes throughout the optimization process and provides interactive explanations. For evaluation, we perform quantitative and qualitative analysis across different datasets and compare our method to state‐of‐the‐art Euler diagram generation methods.
PaTeCon: A Pattern-Based Temporal Constraint Mining Method for Conflict Detection on Knowledge Graphs

Temporal facts, the facts for characterizing events that hold in specific time periods, are attracting rising attention in the knowledge graph (KG) research communities. In terms of quality management, the introduction of time restrictions brings new challenges to maintaining the temporal consistency of KGs and detecting potential temporal conflicts. Previous studies rely on manually enumerated temporal constraints to detect conflicts, which are labor-intensive and may have granularity issues. We start from the common pattern of temporal facts and constraints and propose a pattern-based temporal constraint mining method, PaTeCon. PaTeCon uses automatically determined graph patterns and their relevant statistical information over the given KG instead of human experts to generate time constraints. Specifically, PaTeCon dynamically attaches type restriction to candidate constraints according to their measuring scores. We evaluate PaTeCon on two large-scale datasets based on Wikidata and Freebase respectively, the experimental results show that pattern-based automatic constraint mining is powerful in generating valuable temporal constraints.
Show Me the Way! Bilevel Search for Synthesizing Programmatic Strategies

The synthesis of programmatic strategies requires one to search in large non-differentiable spaces of computer programs. Current search algorithms use self-play approaches to guide this search. The issue with these approaches is that the guiding function often provides a weak search signal. This is because self-play functions only measure how well a program performs against other programs. Thus, while small changes to a losing program might not transform it into a winning one, such changes might represent steps in the direction of a winning program. In this paper we introduce a bilevel search algorithm that searches concurrently in the space of programs and in a space of state features. Each iteration of the search in the space of features defines a set of target features that the search in the program space attempts to achieve (i.e., features one observes while following the strategy encoded in a program). We hypothesize the combination of a self-play function and a feature-based one provides a stronger search signal for synthesis. While both functions are used to guide the search in the program space, the self-play function is used to guide the search in the feature space, to allow for the selection of target features that are more likely to lead to winning programs. We evaluated our bilevel algorithm in MicroRTS, a real-time strategy game. Our results show that the bilevel search synthesizes stronger strategies than methods that search only in the program space. Also, the strategies our method synthesizes obtained the highest winning rate in a simulated tournament with several baseline agents, including the best agents from the two latest MicroRTS competitions.