检索结果-内蒙古大学图书馆

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Wang, Mingxia Tian, Peng Xiong, Yun Yue, Jingwen Zhang, Yao Tang, Chunlei Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Brigham and Women’s Hospital Harvard Medical School BostonMA United States

ISBN: (纸本)9783031306716

The large-scale application of medical knowledge graphs has greatly raised the intelligence level of modern medicine. Considering that entity references between multiple medical knowledge graphs can lead to redundancy, knowledge graph alignment tasks are required to identify entity pairs or subgraphs of heterogeneous knowledge graphs pointing to the same elements in the real world. Existing medical knowledge graph alignment methods do not consider the multi-type features of medical entities. To tackle above challenge, we propose a Multi-type Entity Alignment model of medical knowledge graphs based on attention mechanism named MulEA. Firstly, MulEA integrates the multi-type information features of medical entities to align various types of entities jointly through constructing an entity multi-type information embedding matrix for medical knowledge graphs. Secondly, MulEA designs a relationship collective aggregation module to fully utilize the features of different relationships to improve alignment accuracy. Finally, we evaluate the performance of MulEA on a real medical knowledge graph alignment dataset MED-OWN-15K, and it achieves the state-of-the-art performance on several metrics, showing the effectiveness of our method. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Efficient Relaxed Functional Dependency Discovery with Minimal Set Cover 40

Efficient Relaxed Functional Dependency Discovery with Minim...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Ding, Xiaoou Liu, Yida Wang, Hongzhi Wang, Chen Song, Yichen Yang, Donghua Wang, Jianmin School of Computer Science and Technology Harbin Institute of Technology China National Engineering Research Center for Big Data Software EIRI Tsinghua University China

ISBN: (纸本)9798350317152

Assessing data quality through Functional Depen-dencies (FDs) is a crucial aspect of data governance. However, with the diverse range of data sources and the exponential growth in data volume, exact FDs can sometimes be impractical for real-world applications. In contrast, relaxed functional dependencies (RFDs), which allows for some flexibility in attribute value comparisons, demonstrates greater adaptability and flexibility for big data scenarios. To address the efficient discovery of RFDs, this paper proposes a novel mining method to supplement the current research gaps. By establishing a difference table for tuples, we transform the problem into a specialized minimal set covering problem. Additionally, we introduce two optimization strategies: reducing the time complexity of enumerating the left-hand side of the base RFDs to 0 (1) and decreasing the search complexity for feasible LHS attributes and threshold candidates from O(2m-l) to O(1.5m-1). We rigorously proof that our mining approach guarantees the identification of validity and minimal RFDs. Experiments on nine real-world datasets reveal that our method significantly improves efficiency compared to existing techniques. Furthermore, it uncovers more concise and higher-quality RFDs. Importantly, the RFDs extracted through our methodology exhibit better performance in downstream cleaning tasks. © 2024 IEEE.

关键词： Quality management

来源：评论

学校读者我要写书评

暂无评论

Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing

引用

Frontiers of computer science 2024年第6期18卷 215-227页

作者： Xiaochuan LIN Kaimin WEI Zhetao LI Jinpeng CHEN Tingrui PEI College of Information Science and Technology&Cyberspace Security Jinan UniversityGuangzhou 510632China National&Local Joint Engineering Research Center of Network Security Detection and Protection Technology Guangzhou 510632China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou 510632China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China

Spatial crowdsourcing(SC)is a popular data collection paradigm for numerous *** the increment of tasks and workers in SC,heterogeneity becomes an unavoidable difficulty in task *** researches only focus on the single-heterogeneous task ***,a variety of heterogeneous objects coexist in real-world SC *** dramatically expands the space for searching the optimal task allocation solution,affecting the quality and efficiency of data *** this paper,an aggregation-based dual heterogeneous task allocation algorithm is put *** investigates the impact of dual heterogeneous on the task allocation problem and seeks to maximize the quality of task completion and minimize the average travel *** problem is first proved to be ***,a task aggregation method based on locations and requirements is built to reduce task ***,a time-constrained shortest path planning is also developed to shorten the travel distance in a *** that,two evolutionary task allocation schemes are ***,extensive experiments are conducted based on real-world datasets in various *** with baseline algorithms,our proposed schemes enhance the quality of task completion by up to 25% and utilize 34% less average travel distance.

关键词： task allocation aggregation shortest path dual heterogeneous spatial crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

An Automated Python Script for data Cleaning and Labeling using Machine Learning Technique

Informatica (Slovenia)

引用

Informatica (Slovenia) 2023年第6期47卷 219-232页

作者： Oladipupo, Matthew Abiola Obuzor, Princewill Chima Bamgbade, Babatunde Joseph Olagunju, Kazeem M. Adeniyi, Abidemi Emmanuel Ajagbe, Sunday Adeola Department of Data Science School of Science Engineering and Environment University of Salford United Kingdom Jericho GRA Ibadan Nigeria Department of Computer Engineering Ladoke Akintola University of Technology LAUTECH Ogbomoso Nigeria Department of Computer Sciences Precious Cornerstone University Ibadan Nigeria Department of Computer & Industrial Production Engineering First Technical University Ibadan Nigeria

Every employee in the company who deals with data needs to have clean, noise-free data. Since data warehouses store and update enormous amounts of data from several sources, there is a potential that some of those references may contain inaccurate data. Due to the noise, inefficacy, and poor characterization of the vast amount of accessible data, as well as the ensuing insensitivity and inefficiencies of human data cleaning and labeling, the presentation of the data has become ambiguous, and the assessment of the information has become difficult. A hole in the creation of a better data analysis method was identified. This helped to guide the creation of a Python script for automatically cleaning and labeling data. The first step in the strategy used in this study to accomplish its goals and objectives was to obtain a financial dataset from the top database, "Kaggle". Create a machine learning (ML) approach in Python that intends to automate the financial dataset cleaning. This covers ingesting data, addressing incomplete data, addressing anomalies, one-hot wrapping and label encoding, extracting date and time values, and data normalization. Implementing an unsupervised machine learning method that attempts to automate financial dataset labeling (k-means). Using the method includes the elbow principle, k-means clustering, data modeling of "age" versus "arrival," dimensionality reductions, computer vision, and dataset categorizing using the groupings. An empirical assessment of the cleaned and labeled automated trading dataset utilizing a comparison of the cleaned dataset before and after PCA adoption. The results show that the developed ML technique not only improved the performance of the audit data used in this study, but also classified the data after cleaning it and removing the unpleasant section and incomplete data, as shown by the k-means segmentation result and grouping by PCA. © 2023 Slovene Society Informatika. All rights reserved.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Design of Provably Secure Authentication Protocol for Edge-Centric Maritime Transportation System

引用

IEEE Transactions on Intelligent Transportation Systems 2023年第12期24卷 14536-14545页

作者： Mahmood, Khalid Shamshad, Salman Ayub, Muhammad Faizan Ghaffar, Zahid Khan, Muhammad Khurram Das, Ashok Kumar National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu610054 China National Yunlin University of Science and Technology Department of Computer Science and Information Engineering Douliu64002 Taiwan King Saud University Center of Excellence in Information Assurance Riyadh11653 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500032 India

The epidemic growth of the Internet of Things (IoT) objects have revolutionized Maritime Transportation Systems (MTS). Though, it becomes challenging for the centralized cloud-centric framework to fulfil the application requirements such as low latency and power utilization. The introduction of the distributed edge-centric framework has recently helped the IoT-enabled MTS to meet these requirements by manipulating the tasks at the edge of the networks. Despite the fact that MTS leverages mobile subscribers by overcoming inherent cloud computing limitations, data security and user privacy requirements in establishing the MTS setup are still non-trivial challenges. In this article, we develop a key agreement solution for mobile users to realize mutual authentication in a single round. Our protocol offers user anonymity to maintain user privacy, and it can prevent physical attacks by physically unclonable functions. Initially, the security analysis is conferred to substantiate our protocol's security persistence or strength. Later, its performance correlation is observed under the assumption of diverse metrics in a predefined empirical setup. The meticulous performance correlation endorses the precedence of our protocol over specified related protocols. © 2000-2011 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Discovering Personalized Characteristic Communities in Attributed Graphs 40

Discovering Personalized Characteristic Communities in Attri...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Niu, Yudong Li, Yuchen Karras, Panagiotis Wang, Yanhao Li, Zhao School of Computing and Information Systems Singapore Management University Singapore University of Copenhagen Department of Computer Science Copenhagen Denmark School of Data Science and Engineering East China Normal University Shanghai China Zhejiang Lab Hangzhou China

ISBN: (纸本)9798350317152

What is the widest community in which a person exercises a strong impact? Although extensive attention has been devoted to searching communities containing given individuals, the problem of finding their unique communities of influence has barely been examined. In this paper, we study the novel problem of Characteristic cOmmunity Discovery (COD) in attributed graphs. Our goal is to identify the largest community, taking into account the query attribute, in which the query node has a significant impact. The key challenge of the COD problem is that it requires evaluating the influence of the query node over a large number of hierarchically structured communities. We first propose a novel compressed COD evaluation approach to accelerate the influence estimation by eliminating redundant computations for overlapping communities. Then, we further devise a local hierarchical reclustering method to alleviate the skewness of hierarchical communities generated by global clustering for a specific query attribute. Extensive experiments confirm the effectiveness and efficiency of our solutions to COD: they find characteristic communities better than existing community search methods by several quality measures and achieve up to 25 x speedups against well-crafted baselines. © 2024 IEEE.

关键词： attributed graph characteristic community community hierarchy influence

来源：评论

学校读者我要写书评

暂无评论

A Global Routing Algorithm for PCB Based on Triangular Grid 5

A Global Routing Algorithm for PCB Based on Triangular Grid

引用

5th International Conference on Circuits and Systems, ICCS 2023

作者： Zhou, Yujing Liu, Qinghai Zhang, Xinhong Chen, Jiarui College of Computer and Data Science Fuzhou University Fuzhou China School of Mathematics and Statistics Fuzhou University Fuzhou China

ISBN: (纸本)9798350308273

Global routing is a critical problem in PCB routing, and its quality greatly affect the PCB design cost. Unlike existing methods based on traditional rectangular grid, this paper present a novel algorithm based on triangular grid model to handle the problem. We first propose a method to sort all the unconnected two-pin nets, then construct a triangular grid graph to represent the routing resources on the printed circuited board. Finally we use the idea of maximum flow to find the paths to complete global routing and use the detailed routing to get the result of completed wires. Experimental results show that our algorithm can spend less time than the two state-of-the-art routers without any design rule violations for all given industrial PCB instances. © 2023 IEEE.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhanced Privacy-Preserving WiFi Fingerprint Localization from CL Encryption

引用

Chinese Journal of Electronics 2024年第6期33卷 1435-1446页

作者： Zhiwei WANG Qiuchi ZHU Zhenqi ZHANG School of Computer Nanjing University of Posts and Telecommunications State Key Laboratory of Public Big Data Guizhou University Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu University of Information Engineering Key Laboratory of Computational Science and Application of Hainan Province Hainan Normal University

The WiFi fingerprint-based localization method is considered one of the most popular techniques for indoor localization. In INFOCOM'14, Li et al. proposed a wireless fidelity(WiFi) fingerprint localization system based on Paillier encryption, which is claimed to protect both client C 's location privacy and service provider S's database privacy. However, Yang et al. presented a practical data privacy attack in INFOCOM'18, which allows a polynomial time attacker to obtain S's database. We propose a novel WiFi fingerprint localization system based on CastagnosLaguillaumie(CL) encryption, which has a trustless setup and is efficient due to the excellent properties of CL encryption. To prevent Yang et al.'s attack, the system requires that S selects only the locations from its database that can receive the nonzero signals from all the available access points in C 's nonzero fingerprint in order to determine C's location. Security analysis shows that our scheme is secure under Li et al.'s threat model. Furthermore, to enhance the security level of privacy-preserving WiFi fingerprint localization scheme based on CL encryption, we propose a secure and efficient zero-knowledge proof protocol for the discrete logarithm relations in C's encrypted localization queries.

关键词： Location awareness Threat modeling data privacy Protocols databases Fingerprint recognition Trustless services Encryption Servers Wireless fidelity

来源：评论

学校读者我要写书评

暂无评论

FL@FM-TheWebConf’24: International Workshop on Federated Foundation Models for the Web 24

FL@FM-TheWebConf’24: International Workshop on Federated Fo...

引用

33rd Companion of the ACM World Wide Web Conference, WWW 2023

作者： King, Irwin Long, Guodong Xu, Zenglin Yu, Han Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Hong Kong Faculty of Engineering and IT University of Technology Sydney Australia School of Computer Science and Technology Harbin Institute of Technology Shenzhen China College of Computing and Data Science Nanyang Technological University Singapore Singapore

ISBN: (纸本)9798400701726

In the evolving landscape of machine learning research, two significant developments have emerged to prominence: foundation models and federated learning. The FL@FM-TheWebConf’24 workshop provides an exciting forum for researchers and practitioners to discuss promising works and chart potential trajectories forward for this emerging field. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Frequency modulation

来源：评论

学校读者我要写书评

暂无评论

Learning from highly sparse spatio-temporal data 24

Learning from highly sparse spatio-temporal data

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Leyan Deng Defu Lian Chenwang Wu Enhong Chen School of Artificial Intelligence and Data Science University of Science and Technology of China School of Artificial Intelligence and Data Science University of Science and Technology of China and School of Computer Science and Technology University of Science and Technology of China

ISBN: (纸本)9798331314385

Incomplete spatio-temporal data in the real world has spawned much research. However, existing methods often utilize iterative message-passing across temporal and spatial dimensions, resulting in substantial information loss and high computational cost. We provide a theoretical analysis revealing that such iterative models are susceptible to data and graph sparsity, causing unstable performances on different datasets. To overcome these limitations, we introduce a novel method named One-step Propagation and Confidence-based Refinement (OPCR). In the first stage, OPCR leverages inherent spatial and temporal relationships by employing a sparse attention mechanism. These modules propagate limited observations directly to the global context through one-step imputation, which is theoretically affected only by data sparsity. Following this, we assign confidence levels to the initial imputations by correlating missing data with valid data. This confidence-based propagation refines the separate spatial and temporal imputation results through spatio-temporal dependencies. We evaluate the proposed model across various downstream tasks involving highly sparse spatio-temporal data. Empirical results indicate that our model outperforms state-of-the-art imputation methods, demonstrating its effectiveness and robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：