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

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Shaojing Sheng Peng Zhou Key Laboratory of Knowledge Engineering with Big Data (Heifei Unversity of Technology) Ministry of Education Heifei China School of Compuster Science and Technology Anhui University Heifei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

As a widely used data structure, graphs are good at characterizing data with internal associations, such as social and biological data. Tree structured data are special and are widely used in many real-world applications, such as organizational structure analysis and genealogical knowledge graph reasoning. For example, in kinship knowledge graph analysis, when a genealogical tree is particularly large (more than 25 levels and 45,000 nodes), it is a great challenge to partition this large tree into a specified number of subtrees with succinct logic and a balanced number of nodes. Therefore, in this paper, we propose the TPA (tree partitioning algorithm) algorithm to achieve a balanced and succinct logic partition of large-scale tree structured data. TPA first extracts all related nodes from a massive graph database and then constructs the convergent subgraph into a complete tree with a specified root node. Specifically, several virtual nodes are supplemented for generation-skipping connected nodes to achieve correct node numbering and partitioning. Finally, a graph partitioning algorithm is executed on the complete tree to obtain a specified number of subtrees with succinct logic and balanced node scales. Experiments conducted on four real-world datasets verify the effectiveness of our TPA algorithm.

关键词： Partitioning algorithms data visualization Convergence data analysis Distributed databases Big data

来源：评论

学校读者我要写书评

暂无评论

Learning Relation-Specific Representations for Few-shot knowledge Graph Completion

arXiv

引用

arXiv 2022年

作者： Li, Yuling Yu, Kui Zhang, Yuhong Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei230601 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China

Recent years have witnessed increasing interest in few-shot knowledge graph completion (FKGC), which aims to infer unseen query triples for a few-shot relation using a few reference triples about the relation. The primary focus of existing FKGC methods lies in learning relation representations that can reflect the common information shared by the query and reference triples. To this end, these methods learn entity-pair representations from the direct neighbors of head and tail entities, and then aggregate the representations of reference entity pairs. However, the entity-pair representations learned only from direct neighbors may have low expressiveness when the involved entities have sparse direct neighbors or share a common local neighborhood with other entities. Moreover, merely modeling the semantic information of head and tail entities is insufficient to accurately infer their relational information especially when they have multiple relations. To address these issues, we propose a Relation-Specific Context Learning (RSCL) framework, which exploits graph contexts of triples to learn global and local relation-specific representations for few-shot relations. Specifically, we first extract graph contexts for each triple, which can provide long-term entity-relation dependencies. To encode the extracted graph contexts, we then present a hierarchical attention network to capture contextualized information of triples and highlight valuable local neighborhood information of entities. Finally, we design a hybrid attention aggregator to evaluate the likelihood of the query triples at the global and local levels. Experimental results on two public datasets demonstrate that RSCL outperforms state-of-the-art FKGC methods. © 2022, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Cross-Domain Feature Representation Learning Method Based on Dual Constraints

Nonlinear Cross-Domain Feature Representation Learning Metho...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Han Ding Yuhong Zhang Shuai Yang Yaojin Lin Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Data Science and Intelligence Application Fujian Province University Zhangzhou China

Feature representation learning is a research focus in domain adaptation. Recently, due to the fast training speed, the marginalized Denoising Autoencoder (mDA) as a standing deep learning model has been widely utilized for feature representation learning. However, the training of mDA suffers from the lack of nonlinear relationship and does not explicitly consider the distribution discrepancy between domains. To address these problems, this paper proposes a novel method for feature representation learning, namely Nonlinear cross-domain Feature learning based Dual Constraints (NFDC), which consists of kernelization and dual constraints. Firstly, we introduce kernelization to effectively extract nonlinear relationship in feature representation learning. Secondly, we design dual constraints including Maximum Mean Discrepancy (MMD) and Manifold Regularization (MR) in order to minimize distribution discrepancy during the training process. Experimental results show that our approach is superior to several state-of-the-art methods in domain adaptation tasks.

关键词： Noise reduction Manifolds Training Adaptation models Kernel Deep learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

LipidIN: a comprehensive repository for flash platform-independent annotation and reverse lipidomics

引用

Nature Communications 2025年第1期16卷 1-17页

作者： Xu, Hao Jiang, Tianhang Lin, Yuxiang Zhang, Lei Yang, Huan Huang, Xiaoyun Mao, Ridong Yang, Zhu Zeng, Changchun Zhao, Shuang Di, Lijun Zhang, Wenbin Zeng, Jun Cai, Zongwei Lin, Shu-Hai The First Affiliated Hospital of Xiamen University State Key Laboratory of Cellular Stress Biology School of Life Sciences XMU-HBN Skin Biomedical Research Center Xiamen University Fujian Xiamen China School of Medicine National Institute for Data Science in Health and Medicine Xiamen University Fujian Xiamen China Department of Breast Surgery Fujian Medical University Union Hospital Fujian Province Fuzhou China School of Pharmaceutical Sciences Xiamen University Fujian Xiamen China College of Ocean Food and Biological Engineering Jimei University Xiamen China State Key Laboratory of Environmental and Biological Analysis Department of Chemistry Hong Kong Baptist University Kowloon Hong Kong Department of General Medicine Shenzhen Longhua District Central Hospital Shenzhen China Xiamen Meliomics Co. Ltd. Fujian Xiamen China Department of Biological Sciences Faculty of Health Sciences University of Macau Macao Department of Occupational and Environmental Health and the Ministry of Education Key Lab of Hazard Assessment and Control in Special Operational Environment School of Public Health Fourth Military Medical University Xi’an China Eastern Institute of Technology Ningbo China

Improving annotation accuracy, coverage, speed and depth of lipid profiles remains a significant challenge in traditional lipid annotation. We introduce LipidIN, an advanced framework designed for flash platform-independent annotation. LipidIN features a 168.5-million lipid fragmentation hierarchical library that encompasses all potential chain compositions and carbon-carbon double bond locations. The expeditious querying module achieves speeds exceeding one hundred billion queries per second across all mass spectral libraries. The lipid categories intelligence model is developed using three relative retention time rules, reducing false positive annotations and predicting unannotated lipids with a 5.7% estimated false discovery rate, covering 8923 lipids cross various species. More importantly, LipidIN integrates a Wide-spectrum Modeling Yield network for regenerating lipid fragment fingerprints to further improve accuracy and coverage with a 20% estimated recall boosting. We further demonstrate the utility of LipidIN in multiple tasks for lipid annotation and biomarker discovery in clinical cohorts. © The Author(s) 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Chinese Lexical Simplification

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2021年 29卷 1819-1828页

作者： Qiang, Jipeng Lu, Xinyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China

Lexical simplification has attracted much attention in many languages, which is the process of replacing complex words in a given sentence with simpler alternatives of equivalent meaning. Although the richness of vocabulary in Chinese makes the text very difficult to read for children and non-native speakers, there is no research work for the Chinese lexical simplification (CLS) task. To circumvent difficulties in acquiring annotations, we manually create the first benchmark dataset for CLS, which can be used for evaluating the lexical simplification systems automatically. To acquire a more thorough comparison, we present five different types of methods as baselines to generate substitute candidates for the complex word that includes synonym-based approach, word embedding-based approach, BERT-based approach, sememe-based approach, and a hybrid approach. Finally, we design the experimental evaluation of these baselines and discuss their advantages and disadvantages. To our best knowledge, this is the first study for CLS task. © 2014 IEEE.

关键词： BERT Lexical simplification pretrained language model unsupervised

来源：评论

学校读者我要写书评

暂无评论

Visual group identification method of technical competitors using LinLog graph clustering algorithm

Visual group identification method of technical competitors ...

引用

IEEE International Conference on Computer Science and Automation engineering (CSAE)

作者： Hong-qi Han Xiaomi An Donghua Zhu Xuefeng Wang Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Ministry of Education School of Information Resource Management Beijing 100872 China School of Management and Economics Beijing Institute of Technology 100872 China

Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.

关键词： Clustering algorithms Patents Algorithm design and analysis Visualization Springs Layout Companies

来源：评论

学校读者我要写书评

暂无评论

Quaternion factorization machines: A lightweight solution to intricate feature interaction modelling

arXiv

引用

arXiv 2021年

作者： Chen, Tong Yin, Hongzhi Zhang, Xiangliang Huang, Zi Wang, Yang Wang, Meng The School of Information Technology and Electrical Engineering The University of Queensland Australia The Machine Intelligence and Knowledge Engineering Laboratory King Abdullah University of Science and Technology Saudi Arabia The Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology China

Due to the sparsity of available features in web-scale predictive analytics, combinatorial features become a crucial means for deriving accurate predictions. As a well-established approach, factorization machine (FM) is capable of automatically learning high-order interactions among features to make predictions without the need for manual feature engineering. With the prominent development of deep neural networks (DNNs), there is a recent and ongoing trend of enhancing the expressiveness of FM-based models with DNNs. However, though better results are obtained with DNN-based FM variants, such performance gain is paid off by an enormous amount (usually millions) of excessive model parameters on top of the plain FM. Consequently, the heavy parameterization impedes the real-life practicality of those deep models, especially efficient deployment on resource-constrained IoT and edge devices. In this paper, we move beyond the traditional real space where most deep FM-based models are defined, and seek solutions from quaternion representations within the hypercomplex space. Specifically, we propose the quaternion factorization machine (QFM) and quaternion neural factorization machine (QNFM), which are two novel lightweight and memory-efficient quaternion-valued models for sparse predictive analytics. By introducing a brand new take on FM-based models with the notion of quaternion algebra, our models not only enable expressive inter-component feature interactions, but also significantly reduce the parameter size due to lower degrees of freedom in the hypercomplex Hamilton product compared with real-valued matrix multiplication. Extensive experimental results on three large-scale datasets demonstrate that QFM achieves 4.36% performance improvement over the plain FM without introducing any extra parameters, while QNFM outperforms all baselines with up to two magnitudes' parameter size reduction in comparison to state-of-the-art peer methods. Copyright © 2021, The Authors. All

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Stabilization of switched systems with unstable modes via mode-partition-dependent ADT

引用

Journal of the Franklin Institute 2023年第2期360卷 1308-1326页

作者： Jin, Cui-Li Wang, Qing-Guo Wang, Rui Wu, Di Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education and School of Control Science and Engineering Dalian University of Technology Dalian116024 China Institute of Artificial Intelligence and Future Networks Beijing Normal University at ZhuhaiGuangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Zhuhai519087 China Key Laboratory of Advanced Technology for Aerospace Vehicles Liaoning Province and School of Aeronautics and Astronautics Dalian University of Technology Dalian116024 China

This paper concerns the stability of switched systems orchestrating between unstable modes. First, a mode partition is applied to select stabilizing switching from the switching between modes from different subsets. Second, a piecewise Lyapunov-like function is applied to decline at stabilizing switching times. Then, the stability criteria build on mode-partition-dependent average dwell time by collecting enough stabilizing switching behavior to stabilize the destabilizing switching behavior and unstable modes. Finally, the simulation verification shows the feasibility and effectiveness of the method. © 2022 The Franklin Institute

关键词： Stability criteria

来源：评论

学校读者我要写书评

暂无评论

Reducing Uncertainty of Low-Sampling-Rate Trajectories

Reducing Uncertainty of Low-Sampling-Rate Trajectories

引用

International Conference on data engineering

作者： Kai Zheng Yu Zheng Xing Xie Xiaofang Zhou School of Information Technology and Electrical Engineering University of Queensland Brisbane Australia Microsoft Research Asia Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China

ISBN: (纸本)9781467300421

The increasing availability of GPS-embedded mobile devices has given rise to a new spectrum of location-based services, which have accumulated a huge collection of location trajectories. In practice, a large portion of these trajectories are of low-sampling-rate. For instance, the time interval between consecutive GPS points of some trajectories can be several minutes or even hours. With such a low sampling rate, most details of their movement are lost, which makes them difficult to process effectively. In this work, we investigate how to reduce the uncertainty in such kind of trajectories. Specifically, given a low-sampling-rate trajectory, we aim to infer its possible routes. The methodology adopted in our work is to take full advantage of the rich information extracted from the historical trajectories. We propose a systematic solution, History based Route Inference System (HRIS), which covers a series of novel algorithms that can derive the travel pattern from historical data and incorporate it into the route inference process. To validate the effectiveness of the system, we apply our solution to the map-matching problem which is an important application scenario of this work, and conduct extensive experiments on a real taxi trajectory dataset. The experiment results demonstrate that HRIS can achieve higher accuracy than the existing map-matching algorithms for low-sampling-rate trajectories.

关键词： Trajectory Roads Global Positioning System Inference algorithms Uncertainty Artificial neural networks educational institutions

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Computing Link-Based Similarity in Real World Networks

Efficient Algorithm for Computing Link-Based Similarity in R...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuanzhe Cai Gao Cong Xu Jia Hongyan Liu Jun He Jiaheng Lu Xiaoyong Du Key Laboratories of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Computer Science University of Aalborg Denmark Department of Management Science and Engineering Tsinghua University China

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.

关键词： Computer networks Collaboration data engineering knowledge engineering Computer science Iterative algorithms Filtering data mining Helium Computer science education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：