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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 会议
50 篇 期刊文献

馆藏范围

165 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

95 篇 工学
- 65 篇 计算机科学与技术...
- 54 篇 软件工程
- 23 篇 生物医学工程（可授...
- 21 篇 生物工程
- 19 篇 控制科学与工程
- 17 篇 信息与通信工程
- 12 篇 机械工程
- 12 篇 化学工程与技术
- 8 篇 光学工程
- 8 篇 电气工程
- 7 篇 交通运输工程
- 5 篇 电子科学与技术（可...
- 3 篇 材料科学与工程（可...
- 3 篇 水利工程
- 2 篇 建筑学
- 2 篇 安全科学与工程
66 篇 理学
- 38 篇 数学
- 28 篇 生物学
- 13 篇 化学
- 11 篇 统计学（可授理学、...
- 6 篇 物理学
- 6 篇 系统科学
35 篇 管理学
- 18 篇 图书情报与档案管...
- 11 篇 管理科学与工程(可...
- 6 篇 公共管理
26 篇 医学
- 19 篇 临床医学
- 13 篇 基础医学(可授医学...
- 11 篇 公共卫生与预防医...
- 8 篇 药学(可授医学、理...
- 3 篇 医学技术（可授医学...
2 篇 农学
1 篇 法学
1 篇 教育学
1 篇 文学

主题

9 篇 feature extracti...
8 篇 predictive model...
8 篇 proteins
7 篇 federated learni...
7 篇 forecasting
7 篇 data models
7 篇 training
6 篇 conferences
5 篇 protein engineer...
5 篇 image segmentati...
5 篇 databases
5 篇 semantics
5 篇 diseases
5 篇 service computin...
4 篇 task analysis
4 篇 neural networks
4 篇 contrastive lear...
4 篇 bioinformatics
4 篇 codes
4 篇 machine learning

机构

58 篇 hunan provincial...
22 篇 central south un...
15 篇 school of comput...
15 篇 school of comput...
10 篇 hunan provincial...
8 篇 hunan provincial...
5 篇 xiangjiang labor...
5 篇 institute of gui...
4 篇 the hunan provin...
4 篇 school of comput...
3 篇 university of sc...
3 篇 hnust hunan prov...
3 篇 school of comput...
2 篇 school of mathem...
2 篇 school of comput...
2 篇 college of compu...
2 篇 huaihua universi...
2 篇 school of electr...
2 篇 fujian provincia...
2 篇 department of co...

作者

39 篇 wang jianxin
31 篇 jianxin wang
15 篇 kuang hulin
15 篇 liu jin
14 篇 jin liu
12 篇 guosheng kang
12 篇 hulin kuang
11 篇 duan junwen
9 篇 kang guosheng
9 篇 hong-dong li
8 篇 liu jianxun
8 篇 jianxun liu
6 篇 qu zhe
6 篇 min li
6 篇 buqing cao
6 篇 xu jinhui
5 篇 jianhong cheng
5 篇 feng qilong
5 篇 zhe qu
4 篇 junwen duan

语言

158 篇 英文
7 篇 其他

检索条件"机构=Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering"

共 165 条记录，以下是81-90 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Prediction of virus-receptor interactions based on multi-view learning and link prediction

Prediction of virus-receptor interactions based on multi-vie...

引用

IEEE International Conference on bioinformatics and Biomedicine (BIBM)

作者： Lingzhi Zhu Kai Zheng Guihua Duan Jianxin Wang Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha Hunan China School of Computer Science and Engineering Hunan Institute of Technology Hengyang Hunan China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Receptor-binding is the first step of viral infection. Discovering potential virus-receptor interactions may give insight into potential strategies for treating viral infectious diseases. Most of computational methods for the virus-receptor interaction prediction are mainly based on sequence information. They neither makes effective use of structure information nor effectively handles with missing values of multiple similarities. In addition, the Link Prediction via linear optimization (LP) only uses contribution of neighbors of a node and ignores contribution of neighbors of another node on the network link. In this article, we present a virus-receptor interaction prediction method (MVLP) based on Multi-View learning and LP via contributions of all neighbors of two nodes on the network link. First, missing values of the receptor secondary structure similarity, the receptor conserved domain secondary structure similarity, the viral protein secondary structure similarity, the viral protein sequence similarity and the viral genome sequence similarity are updated by the gaussian radial basis function (GRB). To improve these similarities, we fuse updated and initial values of each similarity with multi-view learning, respectively. Next, three virus values and receptor similarities are integrated into the comprehensive virus and receptor similarity by the averaging method, respectively. Finally, LP based on contribution of neighbors of two nodes is presented for the virus-receptor interaction prediction. To evaluate the ability of MVLP, we compare MVLP with four related methods in 10 fold Cross-Validation (10CV). Computational results indicate that an average Area Under Curve (AUC) values of MVLP on viralReceptor sup and viralReceptor are 0.9427 and 0.9444, respectively, which are superior to other related methods. Furthermore, a case study also demonstrates the ability of MVLP in practice.

关键词： Protein engineering computer viruses Infectious diseases Fuses Genomics Prediction methods Protein sequence

来源：评论

学校读者我要写书评

暂无评论

Interactive Web API Recommendation via Exploring Mashup-API Interactions and Functional Description

Interactive Web API Recommendation via Exploring Mashup-API ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Wanjun Chen Qiqi Chen Jiexun Shen Guosheng Kang Jianxun Liu Buqing Cao Lihong Zhang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the advance of service computing technology, the number of Web APIs has risen dramatically over the Internet. Users tend to use Web APIs to achieve their business needs. However, it is difficult for users to find and select the desirable ones due to the plethora of Web APIs. To address this problem, some collaborative filtering-based Web API recommendation methods have been proposed even though their performance is still far from satisfaction, since they only rely on Mashup-API interactions and feature interactions are not considered in the recommendation model. To further improve the recommendation performance, this paper proposes an interactive Web API recommendation method via exploring both Mashup-API interactions and functional description documents of Mashups and Web APIs. Specifically, LightGCN is employed to derive the node representations for the Mashup-API interaction graph, and BERT model is used for the text representations of functional description documents. Furthermore, the two presentations of both the Mashup and Web API are concatenated as the input of ANFM (Attentional Neural Factorization Machine) model, in which low and high-order feature interactions are fully modeled and the weights of feature interactions are trained by attention mechanism. Solid experiments are conducted over a real-world dataset and the experimental results indicate that the proposed method outperforms the baseline methods.

关键词： Attention mechanisms Federated learning Mashups Computational modeling Semantics Neural networks Service computing

来源：评论

学校读者我要写书评

暂无评论

Multi-view Hypergraph-based Self-supervised Learning Model for Web API Recommendation

Multi-view Hypergraph-based Self-supervised Learning Model f...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Jiexun Shen Dongfan Li Wanjun Chen Yong Xiao Guosheng Kang Jianxun Liu Zhenlian Peng School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

With the rapid development of service computing technology, how to recommend the desirable Web APIs to developers from the large number of APIs is a challenge. The traditional methods based on collaborative filtering are limited by data sparsity. With the support of multi-dimensional relational feature modeling, graph neural network-based methods are proposed to mitigate data sparsity, but their convolution nature may amplify the noise effect. Therefore, how to simultaneously reduce the impact of sparsity and noisy data has been an open question in the field of API recommendation. To address the problem, this paper proposes a self-supervised learning method based on multi-view hypergraph for Web API recommendation. First, the Mashup-API interaction graph is transformed into a hypergraph, and the hyperedges are used as intermediate hubs to transfer messages between nodes, maintaining the global collaboration effect between Mashup and API nodes. Then, a multi-view strategy is adopted to generate embeddings of Mashups and APIs through information fusion, by which recommendation probability is derived by dot product between the embeddings of Mashups and Web APIs. To train the model parameters effectively, a self-supervised learning method is used to reduce the effect of noisy data to improve the embeddings. Extensive experiments are conducted on a real-world dataset, and the experimental results show that the proposed model outperforms the baselines.

关键词： Knowledge engineering Mashups Noise Neural networks Collaboration Service computing Self-supervised learning Feature extraction Data models Noise measurement

来源：评论

学校读者我要写书评

暂无评论

JMF-SS: Joint Matrix Factorization for Web API Recommendation with Mashup-Mashup Similarities and API-API Similarities

JMF-SS: Joint Matrix Factorization for Web API Recommendatio...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Lihong Zhang Jing He Yamei Nie Xiaokang Zhou Qiqi Chen Guosheng Kang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the development of service computing technology, the number of publicly available Web APIs online has increased dramatically. Developers tend to use Web APIs to implement their software development requirements. However, due to the large number of Web APIs, how to select the appropriate Web API from the huge resource library for Mashup development has become a challenge. To solve this problem, some researchers have proposed Web API recommendation methods based on collaborative filtering or matrix factorization. However, the Web API recommendation performance is still limited due to the reliance on Mashup- API interaction and the ignorance of Mashup and Web API description documents. Moreover, the Mashup-API interaction matrix is extremely sparse, resulting in low accuracy in matrix factorization and collaborative filtering. To further improve the recommendation performance, we propose a novel joint matrix factorization method for the Mashup-API interaction matrix by incorporating the Mashup-Mashup similarity matrix and the API-API similarity matrix. A set of experiments are conducted on a real-world dataset, and the experimental results show that the proposed method outperforms the baselines.

关键词： Measurement Accuracy Federated learning Mashups Collaborative filtering Service computing Libraries

来源：评论

学校读者我要写书评

暂无评论

A General Complementary API Recommendation Framework based on Learning Model

A General Complementary API Recommendation Framework based o...

引用

IEEE International Conference on Web Services (ICWS)

作者： Qiqi Chen Guosheng Kang Yamei Nie Jianxun Liu Buqing Cao HNUST Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

With the advancement of service computing technology, the Internet has witnessed an exponential proliferation of Web APIs. However, the selection of suitable APIs from this vast pool for Mashup creation poses a great challenge for users. Various Web API recommendation methods have been proposed to address this issue, aiming to simplify the complex selection process. Despite these efforts, limited studies have been conducted on complementary function recommendation. In this context, a general complementary Web API recommendation framework based on a learning model, named CoWAR, is designed to recommend complementary Web APIs tailored for Mashup creation, based on the user’s selected Web APIs. Specifically, we propose a data labeling algorithm to generate the labeled dataset based on Mashup-API interactions derived from historical Mashups and Web APIs. Additionally, we employ BERT model to generate representation vectors of Web APIs based on the functionality description documents. Subsequently, we utilize SANFM (Self-Attentional Neural Factorization Machines) to train the complementary Web API recommendation model with the labeled sample dataset based on representation vectors of Web APIs. To the best of our knowledge, this is the first work addressing the complementary function recommendation problem with a learning model. By conducting a set of experiments over a real-world dataset, the effectiveness of the proposed approach is validated. The experimental results demonstrate that the learning model outperforms the traditional machine learning-based models and several deep learning-based models.

关键词： Training Measurement Mashups Service computing Vectors Data models labeling Context modeling

来源：评论

学校读者我要写书评

暂无评论

Online Course Recommendation by Exploring User Interaction and Course Description

Online Course Recommendation by Exploring User Interaction a...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Weike Zhou Xiaokang Zhou Jing He Yamei Nie Qiqi Chen Guosheng Kang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the wide use of Massive Open Online Courses (MOOCs) and online education, the large number and variety of educational resources on the online course open platform make it difficult for users to choose, and the requirements for course recommendation algorithms and model performance are getting higher and higher. The existing course recommendation algorithms often ignore the interactive information between n learners and courses and the course descriptions, resulting in poor recommendation performance. To solve the problems above, our work proposes an online course recommendation approach via exploring user interactions and course description documents. Specifically, LightGCN model is used to represent the user-course interaction graph to derive the structural embeddings of users and courses. Moreover, BERT model is used to represent the course description documents to derive the description embeddings of courses. Based on the three embeddings, ANFM (Attention Neural Factorization Machine) model is applied to perform online course recommendation by modeling low-order and high-order feature interactions, and learning the weights of the feature interactions through the attention mechanism. Finally, solid experiments are conducted over a real-world public dataset. Experimental results show that the proposed approach outperforms the baseline methods under NDCG, Recall and Precision.

关键词： Electronic learning Attention mechanisms Federated learning Education Solids

来源：评论

学校读者我要写书评

暂无评论

MTFIL-Net: Automated Alzheimer's disease detection and MMSE score prediction based on feature interactive learning

MTFIL-Net: Automated Alzheimer's disease detection and MMSE ...

引用

2021 IEEE International Conference on bioinformatics and Biomedicine, BIBM 2021

作者： Liu, Jin Tian, Xu Wang, Jianxin Guo, Rui Kuang, Hulin Central South University Hunan Province Key Lab on Bioinformatics School of Computer Science and Engineering Changsha China

ISBN: (纸本)9781665401265

Automatic detection of Alzheimer's disease (AD) is conducive to intervention in the disease progression. MMSE score prediction can reveal the development of AD. In recent years, some studies have designed multi-task methods for AD detection and MMSE score prediction to take advantage of the correlation between them. However, how to use the correlation between the two task features is still a problem. To address this challenge, we propose a multi-task feature interactive leanrning network (MTFIL-Net) to perform AD detection and MMSE score prediction. First, we interact the features acquired by CNNs corresponding to the two tasks to take advantage of the feature correlation between the two tasks. The interaction module extracts the shared features of the two tasks and concatenate them with the features of the two task. Then, we design a joint loss based on cross entropy and smooth L1 function. We use the distribution of MMSE scores to dynamically adjust the relationship between the two tasks. We validate our method with subjects from the Alzheimer's Disease Neuroimaging Initiative (ADNI). We use the ADNI1 dataset for training and testing, and used the ADNI2 dataset as an external validation set. Our proposed MTFIL-Net reached an ACC of 0.86 for AD detection and a correlation coefficient of 0.67 for MMSE score prediction on the ADNI1 dataset, and reached an ACC of 0.85 for AD detection and a correlation coefficient of 0.66 for MMSE score prediction on the ADNI2 dataset. Experiment results show that MTFIL-Net effectively utilizes the correlation between AD and MMSE score. © 2021 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Fully Automated CT-Guided Learning for Survival Prediction of Esophageal Cancer

A Fully Automated CT-Guided Learning for Survival Prediction...

引用

IEEE International Conference on bioinformatics and Biomedicine (BIBM)

作者： Hailin Yue Jin Liu Hulin Kuang Jianhong Cheng Junjian Li Jianxin Wang Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha China Institute of Guizhou Aerospace Measuring and Testing Technology Guiyang China

Accurately predicting survival of esophageal cancer is essential for clinical precision treatment. However, the existing region of interest (ROI) based methods not only require prior medical knowledge to complete the delineation of tumor, but may also lead to excessive sensitivity of the model towards ROI. To address these challenges, we design a fully automated CT-guided learning that combines a CNN-Transformer size aware U-Net and a ranked survival prediction network together to automatically predict the survival of patients with esophageal cancer. Specifically, we first incorporate the Transformer with shifted windowing multi-head self-attention mechanism into the base of the encoder in the U-Net to capture the long-range dependency in the 3D CT images. Then, to alleviate the imbalance between the ROI and the background in CT images, we design a size-aware coefficient for the segmentation loss. Finally, we design a ranked pair sorting loss to learn more fully the ranked information hidden in esophageal cancer patients. To validate the effectiveness of our method, we conduct extensive experiments on a dataset containing 759 esophageal cancer samples. The experimental results demonstrate that our proposed method can still achieve the best performance in survival prediction without ROI ground truth.

关键词：

来源：评论

学校读者我要写书评

暂无评论

M3CI-Net: Multi-Modal MRI-Based Characteristics Inspired Network for IDH Genotyping

M3CI-Net: Multi-Modal MRI-Based Characteristics Inspired Net...

引用

IEEE International Conference on bioinformatics and Biomedicine (BIBM)

作者： Jingxiao Yao Jin Liu Jianhong Cheng Hulin Kuang Jianxin Wang Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha China Institute of Guizhou Aerospace Measuring and Testing Technology Guiyang China

Isocitrate dehydrogenase (IDH) is a key molecular feature for gliomas, and the prediction of IDH is also an important task for computer-aided diagnosis using magnetic resonance imaging (MRI). To address this changllenge, we introduce a multi-modal MRI-based characteristics inspired network for IDH Genotyping (M 3 CI-Net), which pay more attention to the different characteristics information of different MRI modalities T1, T2, T1ce, Flair. In M 3 CI-Net, a pre-fusion module with multi-channel attention mechanism is used to fuse T1ce and Flair modalities and capture as much as possible luminance and contrast information, and the edge information is obtained from T2 modality by using edge detection module. Finally, the feature information between modalities are fused and input into a CNN-Transformer based encoder structure to extract shared spatial and global information from multi-modal MRI, and the information of multiple scales frome encoder are input into the linear layer for IDH genotype classification after pooling, meanwhile, the CNN based decoder with skip-connection for glioma segmentation works for assisting IDH genotyping. Then, we proposed images’ pre-fusion loss, segmentation loss, IDH genotyping loss, and use uncertainty weight training method to balance the weights of these loss. we evaluate our proposed method on Brats2020, and achieve an acceracy of 0.88, an AUC of 0.94, a specificity of 0.92, a sensitivity of 0.84 in IDH genotyping, which is superior to the state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TH-SLP: Web Service Link Prediction Based on Topic-aware Heterogeneous Graph Neural Network

TH-SLP: Web Service Link Prediction Based on Topic-aware Het...

引用

IEEE International Conference on Web Services (ICWS)

作者： Qian Peng Buqing Cao Xiang Xie Shanpeng Liu Guosheng Kang Jianxun Liu School of Computer Science and Engineering & Hunan Provincial Key Lab. For Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan Hunan China

With the emergence of more and more Web services, finding suitable services becomes a difficult problem. Service link prediction is employed to disclose relationships among services, which facilitates the further development of service composition, selection, and recommendation. But the existing link prediction approaches simply utilize the structural features of the service network. In reality, the rich text content in service node description documents also carries latent but fine-grained semantics generated by multifaceted topic-aware factors, yet few efforts are committed to mining them. In this paper, we propose a Web service link prediction method based on a topic-aware heterogeneous graph neural network. Specifically, the method consists of two main layers, including the meta-path intra-decomposition and the meta-path inter-mergence. Meta-path intra-decomposition aims to mine the topic distribution of the meta-paths-based context while capturing fine-grained topic-aware semantics. Meta-path inter-mergence uniquely aggregates topic-aware factors according to the mined distribution and adopts a multifaceted attention mechanism to aggregate different meta-paths, enabling service nodes to generate multifaceted topic-aware embeddings that preserve not only the structure and but also the topic-aware semantics. In addition, a topic prior guidance regularization item is set up for quality assurance of multifaceted topic-aware embedding that depends on global knowledge of the unstructured text content in description documents. Experimental results on real datasets show that our proposed model outperforms other existing baselines methods in the link prediction task, successfully validating the effectiveness of our proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共17页 << < 5 6 7 8 9 10 11 12 13 14 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：