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

12th IEEE International Conference on big knowledge, ICBK 2021

作者： Tai, Changyang Yang, Ze Zhang, Huicheng Wu, Gongqing Lv, Junwei Bao, Xianyu Key Laboratory of Knowledge Engineering With Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

ISBN: (纸本)9781665438582

Multivariate time series (MTS) classification has been regarded as one of the most challenging problems in data mining due to the difficulty in modeling the correlation of variables and samples. In addition, high-dimensional MTS modeling has a large time and space consumption. This paper proposes a novel method, Gaussian Model-based Fully Convolutional Networks (GM-FCN), to improve the performance of high-dimensional MTS classification. Each original MTS is converted into multivariate Gaussian model parameters as the input of FCN. These parameters effectively capture the correlation be-tween MTS variables and significantly reduce the data scale by aligning an MTS size to its dimension. FCN is designed to learn more in-depth features of MTS based on these parameters for modeling the correlation between samples. Thus, GM-FCN can not only model the correlation between variables, but also the correlation between samples. We compare GM-FCN with nine state-of-the-art MTS classification methods, INN-ED, INN-DTW-i, INN-DTW-D, KLD-GMC, MLP, ResNet, Encoder, MCNN, and MCDCNN, on four high-dimensional public datasets, experimen-tal results show that the accuracy of G M - FCN is significantly superior to the others. Besides, the training time of GM-FCN is dozens of times faster than FCN using the original equal-length MTS data as input. © 2021 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

MTSC-GE: A Novel Graph based Method for Multivariate Time Series Clustering 12

MTSC-GE: A Novel Graph based Method for Multivariate Time Se...

引用

12th IEEE International Conference on big knowledge, ICBK 2021

作者： Yang, Ze Tai, Changyang Wu, Gongqing Zhang, Zan Bao, Xianyu Key Laboratory of Knowledge Engineering With Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

ISBN: (纸本)9781665438582

Few clustering methods show good performance on multivariate time series (MTS) data. Traditional methods rely too much on similarity measures and perform poorly on the MTS data with complex structures. This paper proposes an MTS clustering algorithm based on graph embedding called MTSC-GE to improve the performance of MTS clustering. MTSC-GE can map MTS samples to the feature representations in a low-dimensional space and then cluster them. While mining the information of the samples themselves, MTSC-GE builds the whole time series data into a graph, paying attention to the connections between samples from an overall perspective and discovering the local structural feature of MTS data. The proposed MTSC-G E consists of three stages. The first stage builds a graph using the original dataset, where each of the MTS samples is regarded as a node in the graph. The second stage uses the graph embedding technique to obtain a new representation of each node. Finally, MTSC-G E uses the K - Means algorithm to cluster based on the newly obtained representation. We compare MTSC-GE with six state-of-the-art benchmark methods on five public datasets, experimental results show that MTSC-GE has achieved good performance. © 2021 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Crop classification method using multi-feature optimal selection combined with an ensemble learning model: A case study of the Sanjiang Plain 5

Crop classification method using multi-feature optimal selec...

引用

5th International Conference on Geology, Mapping, and Remote Sensing, ICGMRS 2024

作者： Huang, Linsheng Lu, Qibao Huang, Wenjiang Li, Jinsong National Engineering Research Center for Agro-Ecological Big Data Analysis& Application Anhui University Hefei China State Key Laboratory of Remote Sensing Science Aerospace Information Research Institute Chinese Academy of Science Beijing China Institute of Space Integrated Ground Network Anhui Co. Ltd. Hefei China

ISBN: (纸本)9781510681712

Crop classification is a crucial step in crop monitoring and yield estimation. Integrating multi-source and multi-temporal remote sensing images can effectively enhance the accuracy of crop classification, but it leads to an increase in the dimensionality of features. It is necessary to employ appropriate feature selection methods and classification algorithms to improve the precision and efficiency of the classification. Therefore, this study takes the Sanjiang Plain as an example, combines multi-temporal features of Sentinel-1/2 images, and conducts research on crop classification methods using the XGBoost ensemble learning algorithm through feature selection methods. The research results show that the feature selection combined with the XGBoost algorithm yields the optimal classification results, reducing the feature dimensions from 195 to 33, with spectral features being the most important. The Kappa coefficient reached 0.941, which is 0.024 and 0.059 higher than RF and SVM, respectively. The error in crop area extraction results compared to the official statistical data is less than 14%. This method can accurately and efficiently perform crop classification, providing a reference for crop classification in the Sanjiang Plain and similar regions. © 2024 SPIE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

MEGCF: Multimodal Entity Graph Collaborative Filtering for Personalized Recommendation

arXiv

引用

arXiv 2022年

作者： Liu, Kang Xue, Feng Guo, Dan Wu, Le Li, Shujie Hong, Richang Hefei University of Technology School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province 485 Danxia Road Anhui Province Hefei230601 China Hefei University of Technology School of Software Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province 485 Danxia Road Anhui Province Hefei230601 China

In most E-commerce platforms, whether the displayed items trigger the user's interest largely depends on their most eye-catching multimodal content. Consequently, increasing efforts focus on modeling multimodal user preference, and the pressing paradigm is to incorporate complete multimodal deep features of the items into the recommendation module. However, the existing studies ignore the mismatch problem between multimodal feature extraction (MFE) and user interest modeling (UIM). That is, MFE and UIM have different emphases. Specifically, MFE is migrated from and adapted to upstream tasks such as image classification. In addition, it is mainly a content-oriented and non-personalized process, while UIM, with its greater focus on understanding user interaction, is essentially a user-oriented and personalized process. Therefore, the direct incorporation of MFE into UIM for purely user-oriented tasks, tends to introduce a large number of preference-independent multimodal noise and contaminate the embedding representations in UIM. This paper aims at solving the mismatch problem between MFE and UIM, so as to generate high-quality embedding representations and better model multimodal user preferences. Towards this end, we develop a novel model, multimodal entity graph collaborative filtering, short for MEGCF. The UIM of the proposed model captures the semantic correlation between interactions and the features obtained from MFE, thus making a better match between MFE and UIM. More precisely, semantic-rich entities are first extracted from the multimodal data, since they are more relevant to user preferences than other multimodal information. These entities are then integrated into the user-item interaction graph. Afterwards, a symmetric linear Graph Convolution Network (GCN) module is constructed to perform message propagation over the graph, in order to capture both high-order semantic correlation and collaborative filtering signals. Finally, the sentiment information fr

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Multi-keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

引用

Computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

Uncertainty-based Model Acceleration for Cancer Classificati...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Gao, Zeyu Mao, Anyu Wu, Jialun Li, Yang Wang, Chunbao Ding, Caixia Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China The First Affiliated Hospital of Xi'an Jiaotong University Department of Pathology Xi'an China Shaanxi Provincial Cancer Hospital Department of Pathology Xi'an China

ISBN: (纸本)9781665468190

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as 'suspicious' regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance. © 2022 IEEE.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Motion Compensation for Learned Video Compression

Spatial-Temporal Motion Compensation for Learned Video Compr...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Qian Huang Wenting Liu Hao Lu Yiming Wang College of Computer Science and Software Engineering Hohai University Nanjing China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

In the past few years, learned video compression has received increasing attention. However, most current learned methods rely on the bilinear warping operations in motion compensation, which is equivalent to a low-pass filtering operation and brings the distortion of reconstruction. To address this problem, we propose a spatial-temporal motion compensation for learned video compression (STMC-LVC). STMC-LVC uses a spatial-temporal motion compensation network (STMC-Net) to fully consider the spatial-temporal correlation between successive frames, performing accurate motion compensation. Specifically, STMC-Net mainly consists of the initial feature prediction module and the fusion module. The initial feature prediction module predicts reference features based on DCN to provide sufficient information for motion compensation. The fusion module obtains temporal attention information by calculating the similarity between features, performs spatial attention operations, and finally performs spatial-temporal fusion, further improving the robustness of motion compensation. In addition, STMC-LVC uses a conditional coding framework. We use a concatenation of the current feature and predicted feature as context to explore spatial-temporal correlations in feature space. Experimental results show that our method effectively improves video compression. Specifically, our model achieves an average of 33.86% and 58.70% bitrate savings than x265 (veryslow) on PSNR and MS-SSIM, respectively.

关键词： Correlation Codecs Filtering Video compression Distortion Motion compensation Robustness Encoding Complexity theory Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Secrecy Performance Analysis of Artificial Noise Assisted Secure Transmission for MISO systems with Multiple Eavesdroppers

Secrecy Performance Analysis of Artificial Noise Assisted Se...

引用

IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)

作者： Panpan Xu Weijie Tan Kun Niu Zhen Li Changgen Peng School of Mathematics and Statistics Guizhou University Guiyang China Key Laboratory of Advanced Manufacturing Technology of Ministry of Education Guizhou China Guizhou Big Data Academy Guizhou University Guiyang China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China College of Big Data and Information Engineering Guizhou University Guiyang China

In the paper, we investigate the secure communication of multiple-input single-output (MISO) systems with multiple eavesdroppers. We jointly design the beamforming (BF) and the artificial noise (AN) in MISO systems with multiple eavesdroppers to enhance the secrecy rate. Furthermore, under the secrecy interrupt constraint, we obtain the calculation formulas of the secrecy interrupt probability and the optimal secrecy rate. The simulation results demonstrate that AN with a higher dimension can effectively obstruct eavesdroppers and enhance the system's optimal secrecy rate. In addition, it is proved that the 1/4 full-dimension AN's secrecy rate close to that of the full-dimension AN in the system with multiple eavesdroppers, allowing the trade-off between system secrecy performance and artificial noise design complexity to be realized.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing Drug-Drug Interaction Prediction by knowledge Graph Embedding

Enhancing Drug-Drug Interaction Prediction by Knowledge Grap...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： CHAO LIU XIZHAO WANG QIANG LIU Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

ISBN: (数字)9798331528041

ISBN: (纸本)9798331528058

Drug-drug interactions (DDIs) refer to the synergistic or antagonistic effects between different drugs. Synergistic effects can enhance therapeutic efficacy, while antagonistic effects may reduce efficacy or even trigger adverse reactions, worsening the patient's condition. Most existing DDI prediction studies overlook the features of chemical bonds between atoms within drug molecules and the interaction types between drug pairs, which to some extent limits the accuracy and reliability of the predictions. In view of this, we have designed a novel framework called KGE-DDI, which leverages knowledge graph embedding (KGE) technology to enhance the prediction of DDIs. Specifically, for individual drug molecules, KGE-DDI first integrates the features of atoms and chemical bond. Then, by introducing attention mechanisms and graph neural network technology, it learns representations of the drug molecules. For pairs of drug molecules, KGE-DDI models their interactions utilizing atom-level Pearson correlation matrices. Finally, it predicts the interactions between drug pairs by employing our designed scoring function. We conducted comprehensive experiments under both transductive and inductive settings, and the results demonstrate the effectiveness and superiority of KGE-DDI in three scenarios: (existing drug, existing drug), (new drug, new drug), and (new drug, existing drug).

关键词： Drugs Measurement Correlation knowledge graphs Atoms Predictive models Graph neural networks Reliability Chemicals Cybernetics

来源：评论

学校读者我要写书评

暂无评论

A transition-based neural framework for Chinese nested entity and relation recognition

引用

IEEE Access 2024年 1-1页

作者： Zhang, Junchi Liu, Mengchi School of Computer Science and Engineering Wuhan Institute of Technology Wuhan Hubei 430073 China Guangzhou Key Laboratory of Big Data and Intelligent School of Computer Science South China Normal University Guangzhou China

Entity and relation extraction for Chinese texts are typical performed in a pipelined fashion in the sense that by first segmenting sequence into words then recognizing entities and relations subsequently. However, this process often leads to the problem of error propagation and prevents cross-task information integration. To address this issue, we propose a novel transition-based model that performs nested entity recognition and relation extraction jointly without the need of word segmentation beforehand, which is achieved by leveraging the recent advance in using a lattice structure for Chinese sentence encodings. On standard ACE benchmarks, our model gives the best results in the literature. Further analyses show the effectiveness of the proposed architecture in capturing structural outputs. Author

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：