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

14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019

作者： Gu, Xue Meng, Ziyao Liang, Yanchun Xu, Dong Huang, Han Han, Xiaosong Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Zhuhai College of Jilin University Zhuhai519041 China Department of Electrical Engineering and Computer Science Informatics Institute and Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States School of Software Engineering South China University of Technology GuangZhou510006 China

ISBN: (纸本)9789811534249

Although deep neural networks (DNNs) play important roles in many fields, the architecture design of DNNs can be challenging due to the difficulty of input data representation, the huge number of parameters and the complex layer relationships. To overcome the obstacles of architecture design, we developed a new method to generate the optimal structure of DNNs, named Evolutionary Strategy-based Architecture Evolution (ESAE), consisting of a bi-level representation and a probability distribution learning approach. The bi-level representation encodes architectures in the gene and parameter levels. The probability distribution learning approach ensures the efficient convergence of the architecture searching process. By using Fashion-MNIST and CIFAR-10, the effectiveness of the proposed ESAS is verified. The evolved DNNs, starting from a trivial initial architecture with one single convolutional layer, achieved the accuracies of 94.48% and 93.49% on Fashion-MNIST and CIFAR-10, respectively, and require remarkably less hardware costs in terms of GPUs and running time, compared with the existing state-of-the-art manual screwed architectures. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Distributed Differential Privacy Preserving Based on Random Forest in Data Centers

引用

Procedia Computer Science 2022年 214卷 1531-1540页

作者： Xi Wang Weibei Fan Jing He Chi-Hung Chi Suzhou Institute of Industrial Technology Suzhou 215006 China Key laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P.R. China College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Department of Neuroscience University of Oxford Oxford OX1 3QR England School of Computer Nanyang Technological University Nanyang Avenue 639798 Singapore

Traditional privacy-preserving technologies have been unable to provide adequate protection and are vulnerable to background knowledge. MapReduce is parallel distributed computing model which has the advantages of good scalability and high fault tolerance. In this paper, we design a differential privacy protection based on MapReduce for the security problems faced in the distributed environment. Firstly, we propose a random forest algorithm DPMRRF that satisfies differential privacy under the MapReduce framework. Secondly, we use the MapReduce framework in the Hadoop platform to make the classification results satisfy differential privacy by adding random noise values to the leaf nodes. Finally, through the design of the feature selection scheme combined with the index mechanism, three different privacy budget allocation methods are adopted, namely, equal distribution, equal distribution and equal distribution. Experiments show that the algorithm has better classification accuracy while ensuring data availability. The proposed algorithm effectively improves the classification accuracy and operating efficiency, and greatly reduces the amount of computation.

关键词： MapReduce Differential privacy protection Random forest Privacy budget

来源：评论

学校读者我要写书评

暂无评论

Enhanced Doubly Robust Learning for Debiasing Post-Click Conversion Rate Estimation

arXiv

引用

arXiv 2021年

作者： Guo, Siyuan Zou, Lixin Liu, Yiding Ye, Wenwen Cheng, Suqi Wang, Shuaiqiang Chen, Hechang Yin, Dawei Chang, Yi School of Artificial Intelligence Jilin University China Baidu Inc. China International Center of Future Science Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China

Post-click conversion, as a strong signal indicating the user preference, is salutary for building recommender systems. However, accurately estimating the post-click conversion rate (CVR) is challenging due to the selection bias, i.e., the observed clicked events usually happen on users’ preferred items. Currently, most existing methods utilize counterfactual learning to debias recommender systems. Among them, the doubly robust (DR) estimator has achieved competitive performance by combining the error imputation based (EIB) estimator and the inverse propensity score (IPS) estimator in a doubly robust way. However, inaccurate error imputation may result in its higher variance than the IPS estimator. Worse still, existing methods typically use simple model-agnostic methods to estimate the imputation error, which are not sufficient to approximate the dynamically changing model-correlated target (i.e., the gradient direction of the prediction model). To solve these problems, we first derive the bias and variance of the DR estimator. Based on it, a more robust doubly robust (MRDR) estimator has been proposed to further reduce its variance while retaining its double robustness. Moreover, we propose a novel double learning approach for the MRDR estimator, which can convert the error imputation into the general CVR estimation. Besides, we empirically verify that the proposed learning scheme can further eliminate the high variance problem of the imputation learning. To evaluate its effectiveness, extensive experiments are conducted on a semi-synthetic dataset and two real-world datasets. The results demonstrate the superiority of the proposed approach over the state-of-the-art methods. The code is available at https://***/guosyjlu/MRDR-DL. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Optimization for Multi-UAV-assisted Mobile Edge Computing

arXiv

引用

arXiv 2024年

作者： Sun, Geng Wang, Yixian Sun, Zemin Wu, Qingqing Kang, Jiawen Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China School of Automation Guangdong University of Technology Guangzhou510006 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Recent developments in unmanned aerial vehicles (UAVs) and mobile edge computing (MEC) have provided users with flexible and resilient computing services. However, meeting the computing-intensive and latency-sensitive demands of users poses a significant challenge due to the limited resources of UAVs. To address this challenge, we present a multi-objective optimization approach for multi-UAV-assisted MEC systems. First, we formulate a multi-objective optimization problem aiming at minimizing the total task completion delay, reducing the total UAV energy consumption, and maximizing the total amount of offloaded tasks by jointly optimizing task offloading, computation resource allocation, and UAV trajectory control. Since the problem is a mixed-integer non-linear programming (MINLP) and NP-hard problem which is challenging, we propose a joint task offloading, computation resource allocation, and UAV trajectory control (JTORATC) approach to solve the problem. However, since the decision variables of task offloading, computation resource allocation, and UAV trajectory control are coupled with each other, the original problem is split into three sub-problems, i.e., task offloading, computation resource allocation, and UAV trajectory control, which are solved individually to obtain the corresponding decisions. Moreover, the sub-problem of task offloading is solved by using distributed splitting and threshold rounding methods, the sub-problem of computation resource allocation is solved by adopting the Karush-Kuhn-Tucker (KKT) method, and the sub-problem of UAV trajectory control is solved by employing the successive convex approximation (SCA) method. Simulation results show that the proposed JTORATC has superior performance compared to the other benchmark methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Attentive Implicit Relation Embedding for Social Recommendation

SSRN

引用

SSRN 2022年

作者： Ma, Xintao Dong, Liyan Wang, Yuequn Li, Yongli Liu, Zhen Zhang, Hao 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 School of Information Science and Technology Northeast Normal University Changchun130117 China Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

Nowadays, recommendation system incorporating social networks has attracted a lot of research attention and is widely used to understand user preferences regarding social relations. Besides, graph neural networks(GNNs) have proven to learn graph-structured data effectively. Thus, integrating GNN into social recommendations has become one challenge. Many approaches encode both the user-item interaction and social relations to learn user preference. However, the implicit relations are also crucial to understanding the features of users and items. Thus, we propose the attentive implicit relation embedding for social recommendation(SR-AIR), which models the user-item interaction and social networks, utilizing a graph attention mechanism on implicit relations of users and items. We evaluate our framework on two real-world datasets and demonstrate that our framework performs the best compared with state-of-the-art baselines © 2022, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

BERST: An Engine and Tool for Exploring Biomedical Entities and Relationships

引用

Chinese Journal of Electronics 2019年第4期28卷 797-804页

作者： BAI Tian GE Yan YANG Changqing LIU Xiaohua GONG Leiguang WANG Ye HUANG Lan College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Yantai Intelligent Information Technologies Ltd. Department of Computer Science and Technology Zhuhai College of Jilin University

To facilitate the search of rapidly growing biomedical knowledge in literature, we developed a Biomedical entity-relationship search tool(BERST). It is also a biomedical knowledge integration framework, which presently contains six popular databases represented in terms of a network of concepts and relations extracted from these knowledge sources. Users search the integrated knowledge network by entering keywords, and BERST returns a sub-network matching and representing the keywords and their relationships. The resulting graph can be navigated interactively allowing users to explore specific paths between any two nodes representing potentially interesting relationships between them. A graphical UI was developed to provide a more intuitive and overall view of the information being searched and studied. BERST framework can be naturally expanded to integrate other biomedical knowledge sources. BERST is implemented as a Java web application.

关键词： Biomedical ontology Relationship mining Relationship searching tool

来源：评论

学校读者我要写书评

暂无评论

Vertex-Disjoint Paths in BCDC Networks

Vertex-Disjoint Paths in BCDC Networks

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Xi Wang Jianxi Fan Suzhou Institute of Industrial Technology Suzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9781665496407

For any integer $n\geq 2,\ B_{n}$ , the $n$ -dimensional BCDC network, based on a class of BC networks, crossed cube, is a server-centric and high-performance data center network for mega data centers with manageable cabling complexity. Implementing vertex-disjoint paths has great value of application in fault-tolerance and multi-path routing of data center networks. In this paper, we construct $n$ vertex-disjoint paths joining every two distinct vertices in $B_{n}$ , whose maximum length is limited by $\lceil\frac{n}{2}\rceil+5$ , where the diameter of $B_{n}$ is $\lceil\frac{n+1}{2}\rceil+1$ . Our results are fundamental and essential for fault-tolerance and multi-path routing in BCDC networks.

关键词： Data centers Fault tolerance Fault tolerant systems Programming Routing Parallel architectures Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Curvature regularization to prevent distortion in graph embedding 34

Curvature regularization to prevent distortion in graph embe...

引用

34th Conference on Neural Information Processing Systems, NeurIPS 2020

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Zhang, Chunxu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign United States Department of Computer Science University of Illinois Urbana-Champaign United States Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China

Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected problem about this proximity-preserving strategy: Graph topology patterns, while preserved well into an embedding manifold by preserving proximity, may distort in the ambient embedding Euclidean space, and hence to detect them becomes difficult for machine learning models. To address the problem, we propose curvature regularization, to enforce flatness for embedding manifolds, thereby preventing the distortion. We present a novel angle-based sectional curvature, termed ABS curvature, and accordingly three kinds of curvature regularization to induce flat embedding manifolds during graph embedding. We integrate curvature regularization into five popular proximity-preserving embedding methods, and empirical results in two applications show significant improvements on a wide range of open graph datasets. © 2020 Neural information processing systems foundation. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Effective Partially View-Aligned Clustering with Triple-Consistency

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Gao, Hang Liu, Cheng Cai, Zuosong Sun, Hongming Li, Gaoyang Li, Ying Du, Wei Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology China Shantou University Department of Computer Science China Tongji University School of Life Sciences and Technology Bioinformatics Department China

Multi-view clustering (MVC), which integrates information from multiple views to enhance performance, has garnered increasing attention in recent years. Partially View-aligned Clustering (PVC), which is a particularly critical aspect of this process, requires a thorough exploration of complementary and consistent information under conditions of partial view alignment. However, most existing PVC methods primarily focus on semantic consistency, employing semantic consistency features for both view alignment and clustering tasks. These methods neglect the effects of noise and complementary information across multiple views and the suitability of these features for clustering. To address these limitations, our approach aims to leverage three distinct types of consistency to extract semantic consistency features and clustering consistency features, which are specifically designed for view alignment and clustering tasks, respectively. By omitting the reconstruction process, we mitigate the adverse effects of mutual information and noise on view alignment. Specifically, we first exploit the structural consistency of similarity graphs across different views to guide feature extraction in view-specific autoencoders. This process produces structural consistency features that are both cluster-discriminative and structurally coherent. Subsequently, two separate multilayer perceptrons (MLPs) are trained via contrastive learning to extract semantic consistency features and clustering consistency features from the structural features. These features are optimized for their respective tasks. Ultimately, a self-paced style view alignment strategy is used to iteratively re-align the data based on semantic and clustering consistency while the model is optimized via the re-aligned data. Extensive experiments on multiple real-world benchmark datasets demonstrate that our method outperforms the state-of-the-art multi-view approaches, highlighting its effectiveness in tackling the challen

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A two-stage HV-driven adaptive multi-objective evolutionary algorithm and its application in fixed polarity reed-muller circuits

引用

Expert Systems with Applications 2025年 288卷

作者： Lu Yang Shengsheng Wang Ruyi Dong Zihao Fu College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China College of Information and Control Engineering Jilin Institute of Chemical Technology Changchun 130012 China

To achieve a balance between convergence and diversity, we proposed a two-stage HV-driven adaptive multi-objective evolutionary algorithm (TSAMEA). TSAMEA employs a sinusoidal decreasing parameter adjustment method to enhance exploration pace in the first stage. An adaptive parameter control mechanism utilizes historical memory pools and an HV-driven degree adjustment strategy to achieve better exploitation in the second stage. Extensive experimental data demonstrate that TSAMEA outperforms nine other compared moeAs. The component analysis illustrates the efficacy of each component of TSAMEA. In addition, area and power optimization are now the main limitations in chip design, TSAMEA is applied to area and power optimization for Fixed Polarity Reed-Muller (FPRM) logic circuits and perform well, which further verifies the ability of the TSAMEA to solve practical problems.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：