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

arXiv 2023年

作者： Hamed, Ahmed Abdeen Wu, Xindong Complex Adaptive Systems and Computational Intelligence Laboratory State University of New York at Binghamton BinghamtonNY13902 United States Sano Centre for Computational Medicine Clinical Data Science Cracow30-072 Poland Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei230009 China China Electronics Data Industry Group Shenzhen518057 China

Generative AI tools exemplified by ChatGPT are becoming a new reality. This study is motivated by the premise that "AI generated content may exhibit a distinctive behavior that can be separated from scientific articles". In this study, we show how articles can be generated using means of prompt engineering for various diseases and conditions. We then show how we tested this premise in two phases and prove its validity. Subsequently, we introduce xFakeSci, a novel learning algorithm, that is capable of distinguishing ChatGPT-generated articles from publications produced by scientists. The algorithm is trained using network models driven from both sources. To mitigate overfitting issues, we incorporated a calibration step that is built upon data-driven heuristics, including proximity and ratios. Specifically, from a total of a 3952 fake articles for three different medical conditions, the algorithm was trained using only 100 articles, but calibrated using folds of 100 articles. As for the classification step, it was performed using 300 articles per condition. The actual label steps took place against an equal mix of 50 generated articles and 50 authentic PubMed abstracts. The testing also spanned publication periods from 2010 to 2024 and encompassed research on three distinct diseases: cancer, depression, and Alzheimer’s. Further, we evaluated the accuracy of the xFakeSci algorithm against some of the classical data mining algorithms (e.g., Support Vector Machines, Regression, and Naive Bayes). The xFakeSci algorithm achieved F1 scores ranging from 80% to 94%, outperforming common data mining algorithms, which scored F1 values between 38% and 52%. We attribute the noticeable difference to the introduction of calibration and a proximity distance heuristic, which underscores this promising performance. Indeed, the prediction of fake science generated by ChatGPT presents a considerable challenge. Nonetheless, the introduction of the xFakeSci algorithm is a significant st

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic knowledge Graph Construction: A Report on the 2019 ICDM/ICBK Contest

Automatic Knowledge Graph Construction: A Report on the 2019...

引用

IEEE International Conference on data Mining (ICDM)

作者： Xindong Wu Jia Wu Xiaoyi Fu Jiachen Li Peng Zhou Xu Jiang Mininglamp Academy of Sciences Mininglamp Technology Beijing China Key Laboratory of Knowledge Engineering with Big Data (Hefei Univ. of Technology) Ministry of Education Hefei China Department of Computing Macquarie University Sydney Australia School of Computer Science and Technology Anhui University Hefei China

Automatic knowledge graph construction seeks to build a knowledge graph from unstructured text in a specific domain or cross multiple domains, without human intervention. IEEE ICDM 2019 and ICBK 2019 invited teams from both degree-granting institutions and industrial labs to compete in the 2019 knowledge Graph Contest by automatically constructing knowledge graphs in at least two different domains. This article reports the outcomes of the Contest. The participants were expected to build a model to extract knowledge represented as triplets from text data and develop a web application to visualize the triplets. Awards were given to five teams. Their models and key techniques used to construct knowledge graphs are summarized.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Personalized Financial News Recommendation Algorithm Based on Ontology

引用

Procedia Computer Science 2015年 55卷 843-851页

作者： Rui Ren Lingling Zhang Limeng Cui Bo Deng Yong Shi School of Management University of Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100190 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

To deal with the challenge of information overload, in this paper, we propose a financial news recommendation algorithm which help users find the articles that are interesting to read. To settle the ambiguity problem, a new presented OF-IDF method is employed to represent the unstructured text data in the form of key concepts, synonyms and synsets which are all stored in the domain ontology. For users, the recommendation algorithm build the profiles based on their behaviors to detect the genuine interests and predict current interests automatically and in real time by applying the thinking of relevance feedback. Finally, the experiment conducted on a financial news dataset demonstrates that the proposed algorithm significantly outperforms the performance of a traditional recommender.

关键词： news recommendation algorithm ontology relevence feedback OF-IDF

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Videos

arXiv

引用

arXiv 2024年

作者： Wu, Sifan Chen, Haipeng Yin, Yifang Hu, Sihao Feng, Runyang Jiao, Yingying Yang, Ziqi Liu, Zhenguang College of Computer Science and Technology Jilin University Changchun China A*STAR Singapore Georgia Institute of Technology Atlanta United States School of Artificial Intelligence Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

Human pose estimation in videos has long been a compelling yet challenging task within the realm of computer vision. Nevertheless, this task remains difficult because of the complex video scenes, such as video defocus and self-occlusion. Recent methods strive to integrate multi-frame visual features generated by a backbone network for pose estimation. However, they often ignore the useful joint information encoded in the initial heatmap, which is a byproduct of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatiotemporal motion features. As a result, the performance of existing methods for pose estimation falls short due to the lack of ability to leverage both local joint (heatmap) information and global motion (feature) dynamics. To address this problem, we propose a novel joint-motion mutual learning framework for pose estimation, which effectively concentrates on both local joint dependency and global pixel-level motion dynamics. Specifically, we introduce a context-aware joint learner that adaptively leverages initial heatmaps and motion flow to retrieve robust local joint feature. Given that local joint feature and global motion flow are complementary, we further propose a progressive joint-motion mutual learning that synergistically exchanges information and interactively learns between joint feature and motion flow to improve the capability of the model. More importantly, to capture more diverse joint and motion cues, we theoretically analyze and propose an information orthogonality objective to avoid learning redundant information from multi-cues. Empirical experiments show our method outperforms prior arts on three challenging benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Learning Two-Stream CNN for Multi-Modal Age-related Macular Degeneration Categorization

arXiv

引用

arXiv 2020年

作者： Wang, Weisen Li, Xirong Xu, Zhiyan Yu, Weihong Zhao, Jianchun Ding, Dayong Chen, Youxin The MoE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China Aimc Lab School of Information Renmin University of China Beijing100872 China Vistel Ai Lab Visionary Intelligence Ltd. Beijing100872 China The Key Lab of Ocular Fundus Disease Chinese Academy of Medical Sciences Dept. of Ophthalmology Peking Union Medical College Hospital Beijing100730 China

This paper tackles automated categorization of Agerelated Macular Degeneration (AMD), a common macular disease among people over 50. Previous research efforts mainly focus on AMD categorization with a single-modal input, let it be a color fundus photograph (CFP) or an OCT B-scan image. By contrast, we consider AMD categorization given a multi-modal input, a direction that is clinically meaningful yet mostly unexplored. Contrary to the prior art that takes a traditional approach of feature extraction plus classifier training that cannot be jointly optimized, we opt for end-to-end multi-modal Convolutional Neural Networks (MM-CNN). Our MM-CNN is instantiated by a two-stream CNN, with spatially-invariant fusion to combine information from the CFP and OCT streams. In order to visually interpret the contribution of the individual modalities to the final prediction, we extend the class activation mapping (CAM) technique to the multi-modal scenario. For effective training of MM-CNN, we develop two data augmentation methods. One is GAN-based CFP/OCT image synthesis, with our novel use of CAMs as conditional input of a high-resolution image-to-image translation GAN. The other method is Loose Pairing, which pairs a CFP image and an OCT image on the basis of their classes instead of eye identities. Experiments on a clinical dataset consisting of 1,094 CFP images and 1,289 OCT images acquired from 1,093 distinct eyes show that the proposed solution obtains better F1 and Accuracy than multiple baselines for multimodal AMD categorization. Code and data are available at https://***/li-xirong/mmc-amd. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

JC5A: Service Delay Minimization for Aerial MEC-assisted Industrial Cyber-Physical Systems

arXiv

引用

arXiv 2024年

作者： Sun, Geng Wu, Jiaxu Sun, Zemin He, Long Wang, Jiacheng Niyato, Dusit Jamalipour, Abbas Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Electrical and Computer Engineering The University of Sydney SydneyNSW2006 Australia Department of Electrical and Computer Engineering Auburn University Auburn United States

In the era of the sixth generation (6G) and industrial Internet of Things (IIoT), an industrial cyber-physical system (ICPS) drives the proliferation of sensor devices and computing-intensive tasks. To address the limited resources of IIoT sensor devices, unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) has emerged as a promising solution, providing flexible and cost-effective services in close proximity of IIoT sensor devices (ISDs). However, leveraging aerial MEC to meet the delay-sensitive and computation-intensive requirements of the ISDs could face several challenges, including the limited communication, computation and caching (3C) resources, stringent offloading requirements for 3C services, and constrained on-board energy of UAVs. To address these issues, we first present a collaborative aerial MEC-assisted ICPS architecture by incorporating the computing capabilities of the macro base station (MBS) and UAVs. We then formulate a service delay minimization optimization problem (SDMOP). Since the SDMOP is proved to be an NP-hard problem, we propose a joint computation offloading, caching, communication resource allocation, computation resource allocation, and UAV trajectory control approach (JC5A). Specifically, JC5A consists of a block successive upper bound minimization method of multipliers (BSUMM) for computation offloading and service caching, a convex optimization-based method for communication and computation resource allocation, and a successive convex approximation (SCA)-based method for UAV trajectory control. Moreover, we theoretically prove the convergence and polynomial complexity of JC5A. Simulation results demonstrate that the proposed approach can achieve superior system performance compared to the benchmark approaches and algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendation

arXiv

引用

arXiv 2021年

作者： Wu, Le He, Xiangnan Wang, Xiang Zhang, Kun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Anhui Hefei230029 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China University of Science and Technology of China Hefei230026 China National University of Singapore Singapore

Influenced by the great success of deep learning in computer vision and language understanding, research in recommendation has shifted to inventing new recommender models based on neural networks. In recent years, we have witnessed significant progress in developing neural recommender models, which generalize and surpass traditional recommender models owing to the strong representation power of neural networks. In this survey paper, we conduct a systematic review on neural recommender models from the perspective of recommendation modeling with the accuracy goal, aiming to summarize this field to facilitate researchers and practitioners working on recommender systems. Specifically, based on the data usage during recommendation modeling, we divide the work into collaborative filtering and information-rich recommendation: 1) collaborative filtering, which leverages the key source of user-item interaction data;2) content enriched recommendation, which additionally utilizes the side information associated with users and items, like user profile and item knowledge graph;and 3) temporal/sequential recommendation, which accounts for the contextual information associated with an interaction, such as time, location, and the past interactions. After reviewing representative work for each type, we finally discuss some promising directions in this field. © 2021, CC BY.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

CEPV: A Tree Structure Information Extraction and Visualization Tool for Big knowledge Graph

CEPV: A Tree Structure Information Extraction and Visualizat...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Shaojing Sheng Peng Zhou Xindong Wu Key Laboratory of Knowledge Engineering with Big Data Heifei Unversity of Technology Ministry of Education Heifei China School of Computer Science and Information Engineering Heifei University of Technology Heifei China School of Computer Science and Technology Anhui University Heifei China Mininglamp Academy of Sciences Mininglamp Technology Beijing China Institute of Big Konowledge Science Heifei University of Technology Heifei China

A large amount of data with rich semantic and structural information has been accumulated in many real-world applications. In order to effectively describe the concepts and connections in these data sets, knowledge graph was proposed as a tool to handle it. The genealogy is a typical tree structure data and can be stored in the knowledge graph. However, due to the complexity and increasing volume of the data, how to efficiently extract and visualize the customized information from the big knowledge graph is hence a challenge and worthy of in-depth study. Motivated by this, we propose a novel user-specified information extraction and visualization tool, named CEPV (the Customized information Extracting, Processing and Visualization tool), for converting the big graph structure data into a specified tree structure display. The main steps of CEPV are as follows: firstly, according to the requirements of users, extracting the specified data from the massive, complex, heterogeneous data as fewer times as possible, which can reduce the frequency of database access and improve the overall efficiency of the algorithm. Secondly, the fault tolerance mechanism and attribute judgment rules are executed to ensure the correctness during the data processing. Finally, the processed data with a complex relationship is presented to the user in multiple visualization models. The high availability and effectiveness of our proposed tool is verified on a big knowledge graph dataset.

关键词： data visualization data mining Tools databases data processing Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

LEGNN: A Label Ensemble Perspective for Training a Label-Noise-Resistant GNN with Reduced Complexity

arXiv

引用

arXiv 2024年

作者： Zhao, Rui Shi, Bin Liang, Zhiming Ruan, Jianfei Dong, Bo Lin, Lu School of Computer Science and Technology Xi'an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China School of Distance Education Xi'an Jiaotong University China College of Information Sciences and Technology Penn State University United States

Graph Neural Networks (GNNs) have been widely employed for semi-supervised node classification tasks on graphs. However, the performance of GNNs is significantly affected by label noise, that is, a small amount of incorrectly labeled nodes can substantially misguide model training. Mainstream solutions define node classification with label noise (NCLN) as a reliable labeling task, often introducing node similarity with quadratic computational complexity to more accurately assess label reliability. To this end, in this paper, we introduce the Label Ensemble Graph Neural Network (LEGNN), a lower complexity method for robust GNNs training against label noise. LEGNN reframes NCLN as a label ensemble task, gathering informative multiple labels instead of constructing a single reliable label, avoiding high-complexity computations for reliability assessment. Specifically, LEGNN conducts a two-step process: bootstrapping neighboring contexts and robust learning with gathered multiple labels. In the former step, we apply random neighbor masks for each node and gather the predicted labels as a high-probability label set. This mitigates the impact of inaccurately labeled neighbors and diversifies the label set. In the latter step, we utilize a partial label learning based strategy to aggregate the high-probability label information for model training. Additionally, we symmetrically gather a low-probability label set to counteract potential noise from the bootstrapped high-probability label set. Extensive experiments on six datasets demonstrate that LEGNN achieves outstanding performance while ensuring efficiency. Moreover, it exhibits good scalability on dataset with over one hundred thousand nodes and one million edges. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Lightweight (reverse) fuzzy extractor with multiple referenced PUF responses

arXiv

引用

arXiv 2018年

作者： Gao, Yansong Su, Yang Xu, Lei Ranasinghe, Damith C. China Data61 CSIRO Sydney Australia School of Computer Science and Engineering NanJing University of Science and Technology China State Key Laboratory of Synthetical Automation for Process Industries Auto-ID Labs School of Computer Science University of Adelaide Australia

A Physical unclonable functions (PUF), alike a fingerprint, exploits manufacturing randomness to endow each physical item with a unique identifier. One primary PUF application is the secure derivation of volatile cryptographic keys using a fuzzy extractor comprising of two procedures: i) secure sketch;and ii) entropy extraction. Although the entropy extractor can be lightweight, the overhead of the secure sketch responsible correcting naturally noisy PUF responses is usually costly. We observe that, in general, response unreliability with respect to a enrolled reference measurement increases with increasing differences between the in-the-field PUF operating condition and the operating condition used in evaluating the enrolled reference response. For the first time, we exploit such an important but inadvertent observation. In contrast to the conventional single reference response enrollment, we propose enrolling multiple reference responses (MRR) subject to the same challenge but under multiple distinct operating conditions. The critical observation here is that one of the reference operating conditions is likely to be closer to the operating condition of the field deployed PUF, thus, resulting in minimizing the expected unreliability when compared to the single reference under the nominal condition. Overall, MRR greatly reduces the demand for the expected number of erroneous bits for correction and, subsequently, achieve a significant reduction in the error correction overhead. The significant implementation efficiency gains from the proposed MRR method is demonstrated from software implementations of fuzzy extractors on batteryless resource constraint computational radio frequency identification devices, where realistic PUF data is collected from the embedded intrinsic SRAM PUFs. Copyright © 2018, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：