1,721,611 research outputs found
Example-based explanations for streaming fraud detection on graphs
No full textFraud detection is one of the most important tasks in Web platforms such as e-commerce, social media, network security, and financial systems. To prevent fraudulent actions from misleading customers or causing significant losses for businesses, various fraud detection methods have been proposed in recent years. However, research on fraud definitions, characteristics, and behaviours has been limited to which users, items, and transactions are considered fraudulent rather than why these entities have been classified as such. This inhibits effective validation of the detected frauds as well as countermeasure design. In this paper, we argue that explanations for discovered frauds may be provided in terms of prior identified frauds. A large variety of comparable frauds would assist investigators to generalise, allowing them to grasp the characteristics that are significant for fraud detection. Feature-annotated graphs are frequently used to detect the type of fraud in which fraudsters commonly interact with a large number of benign users to conceal themselves. Given a fraud subgraph, we propose a query-by-example approach for indexing and extracting the k most similar and diverse fraud subgraphs from prior frauds. To achieve an efficient and adaptive realisation of the approach in a streaming setting, we present a novel graph representation learning technique and discuss the implementation considerations. Comparing our study against baseline techniques revealed that our approach outperforms them in delivering meaningful explanations for various fraud camouflage behaviours.Full Tex
Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment
No full textThe task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entities in the Euclidean space with translation assumption and graph neural network approaches. However, real vectors inherently neglect the complex relation structures and lack the expressiveness of embeddings; hence, they may guide the embeddings to be falsely generated which results in alignment performance degradation. To overcome these problems, we propose a novel KG alignment framework, ComplexGCN, which learns the embeddings of both entities and relations in complex spaces while capturing both semantic and neighborhood information simultaneously. The proposed model ensures richer expressiveness and more accurate embeddings by successfully capturing various relation structures in complex spaces with high-level computation. The model further incorporates relation label and direction information with a low degree of freedom. To compare our proposal against the state-of-the-art baseline techniques, we conducted extensive experiments on real-world datasets. The empirical results show the efficiency and effectiveness of the proposed method.Full Tex
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
On-device diagnostic recommendation with heterogeneous federated BlockNets
Full text linkThe evolution of edge computing has advanced the accessibility of E-health recommendation services, encompassing areas such as medical consultations, prescription guidance, and diagnostic assessments. Traditional methodologies predominantly utilize centralized recommendations, relying on servers to store client data and dispatch advice to users. However, these conventional approaches raise significant concerns regarding data privacy and often result in computational inefficiencies. E-health recommendation services, distinct from other recommendation domains, demand not only precise and swift analyses but also a stringent adherence to privacy safeguards, given the users’ reluctance to disclose their identities or health information. In response to these challenges, we explore a new paradigm called on-device recommendation tailored to E-health diagnostics, where diagnostic support (such as biomedical image diagnostics), is computed at the client level. We leverage the advances of federated learning to deploy deep learning models capable of delivering expert-level diagnostic suggestions on clients. However, existing federated learning frameworks often deploy a singular model across all edge devices, overlooking their heterogeneous computational capabilities. In this work, we propose an adaptive federated learning framework utilizing BlockNets, a modular design rooted in the layers of deep neural networks, for diagnostic recommendation across heterogeneous devices. Our framework offers the flexibility for users to adjust local model configurations according to their device’s computational power. To further handle the capacity skewness of edge devices, we develop a data-free knowledge distillation mechanism to ensure synchronized parameters of local models with the global model, enhancing the overall accuracy. Through comprehensive experiments across five real-world datasets, against six baseline models, within six experimental setups, and various data distribution scenarios, our architecture demonstrates unparalleled performance and robustness in terms of both accuracy and efficiency.Full Tex
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
10X Faster Subgraph Matching: Dual Matching Networks with Interleaved Diffusion Attention
No full textThe goal of subgraph matching is to determine the presence of a particular query pattern within a large collection of data graphs. Despite being a hard problem, subgraph matching is essential in various disciplines, including bioinformatics, text matching, and graph retrieval. Although traditional approaches could provide exact solutions, their computations are known to be NP-complete, leading to an overwhelmingly querying latency. While recent neural-based approaches have been shown to improve the response time, the oversimplified assumption of the first-order network may neglect the generalisability of fully capturing patterns in varying sizes, causing the performance to drop significantly in datasets in various domains. To overcome these limitations, this paper proposes xDualSM, a dual matching neural network model with interleaved diffusion attention. Specifically, we first embed the structural information of graphs into different adjacency matrices, which explicitly capture the intra-graph and cross-graph structures between the query pattern and the target graph. Then, we introduce a dual matching network with interleaved diffusion attention to carefully capture intra-graph and cross-graph information while reducing computational complexity. Empirically, our proposed framework not only boosted the speed of subgraph matching more than 10x compared to the fastest baseline but also achieved significant improvements of 47.64% in Recall and 34.39% in F1-score compared to the state-of-the-art approximation approach on COX2 dataset. In addition, our results are comparable with exact methods.Full Tex
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
