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

3rd IEEE International Conference on Intelligent Technologies, CONIT 2023

作者： Kumar, Purushottam Tiwari, Pranav Srinivasulu Reddy, U. Machine Learning & Data Analytics Lab CoE in Artificial Intelligence National Institute of Technology Trichy India Indian Institute of Information Technology Tiruchirappalli Computer Science and Engineering Trichy India National Institute of Technology Machine Learning & Data Analytics Lab Department of Computer Applications Trichy India

ISBN: (纸本)9798350338607

Due to the ever-growing population, rapid urbanization, unusual environmental change, and dwindling water supply, the food production from conventional farming techniques won't be able to keep up with increasing food demand for long, leading to severe food scarcity. Aquaponics is emerging as a viable alternative to food cultivation techniques but lacks efficiency, hindering its adoption on a large-scale production basis. The adoption of Artificial intelligence (AI) techniques in smart aquaponic farming can further contribute to increasing the yield in aquaponics. In the study, both linear and non-linear regression algorithms such as linear regression, lasso regression, ridge regression, KNN regression, SVR, and decision tree regression were trained on aquaponic fish pond dataset, evaluated on the basis of multiple metrics like MAE, MSE, RMSE, and RMSLE, and a competitive analysis was done to determine the best algorithm for predicting the harvest weight of the fish in aquaponic ponds. The results showed that KNN regression and decision tree regression algorithms have lowest error and highest accuracy of 99.15% and 99.1% respectively, for predicting the harvest weight of the fish. The results obtained could be scaled up to commercial levels and used in regulating nutrient concentration and aquatic environmental conditions © 2023 IEEE.

关键词： Fish

来源：评论

学校读者我要写书评

暂无评论

Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad Hoc Networks 12

Software Defined Networking Based On-Demand Routing Protocol...

引用

12th International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2016

作者： Dong, Baihong Wu, Weigang Yang, Zhiwei Li, Junjie School of Data and Computer Science Sun Yat-Sen University China Guangdong Key Lab of Big Data Analysis and Processing China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

ISBN: (纸本)9781509056965

This paper comes up with a SDN based On-Demand Routing Protocol, SVAO, which separates data forwarding layer and network control layer, as in SDN, to enhance the data transmission efficiency within VANETs. The Roadside Service Unit plays the role of Local Controller and is in charge of selecting vehicles to forward packet within a road segment. All the vehicles state in the road. Correspondingly, a two-level design is used. Global Level is distributed and adopts a ranked query scheme to collect vehicle information and determine the road segments along which a message should be forwarded. And the Local Level is in charge of selecting forwarding vehicles in each road segment determined by the global level. We compare SVAO with popular ad-hoc network routing protocols, including OLSR, DSR, DSDV, and DB via simulations. We consider the impact of vehicle density, speed on data transmission rate and average packet delay. The simulation results show that in case of large network scales or high vehicle speed, SVAO performs better than the others. © 2016 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Quantus: An Explainable AI Toolkit for Responsible Evaluation of Neural Network Explanations and Beyond

引用

Journal of machine Learning Research 2023年第1期24卷 1-11页

作者： Hedström, Anna Weber, Leander Bareeva, Dilyara Krakowczyk, Daniel Motzkus, Franz Samek, Wojciech Lapuschkin, Sebastian Höhne, Marina M.-C. Understandable Machine Intelligence Lab TU Berlin Berlin10587 Germany Department of Electrical Engineering and Computer Science TU Berlin Berlin10587 Germany Department of Artificial Intelligence Fraunhofer Heinrich-Hertz-Institute Berlin10587 Germany Department of Computer Science University of Potsdam Potsdam14476 Germany BIFOLD – Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany

The evaluation of explanation methods is a research topic that has not yet been explored deeply, however, since explainability is supposed to strengthen trust in artificial intelligence, it is necessary to systematically review and compare explanation methods in order to confirm their correctness. Until now, no tool with focus on XAI evaluation exists that exhaustively and speedily allows researchers to evaluate the performance of explanations of neural network predictions. To increase transparency and reproducibility in the field, we therefore built Quantus—a comprehensive, evaluation toolkit in Python that includes a growing, wellorganised collection of evaluation metrics and tutorials for evaluating explainable methods. The toolkit has been thoroughly tested and is available under an open-source license on PyPi (or on https://***/understandable-machine-intelligence-lab/Quantus/). © 2023 Anna Hedström, Leander Weber, Dilyara Bareeva, Daniel Krakowczyk, Franz Motzkus, Wojciech Samek, Sebastian Lapuschkin, and Marina M.-C. Höhne.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Continual learning of new diseases with dual distillation and ensemble strategy 23rd

Continual learning of new diseases with dual distillation an...

引用

23rd International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2020

作者： Li, Zhuoyun Zhong, Changhong Wang, Ruixuan Zheng, Wei-Shi School of Data and Computer Science Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing MOE Guangzhou China Pazhou Lab Guangzhou China

ISBN: (纸本)9783030597092

Most intelligent diagnosis systems are developed for one or a few specific diseases, while medical specialists can diagnose all diseases of certain organ or tissue. Since it is often difficult to collect data of all diseases, it would be desirable if an intelligent system can initially diagnose a few diseases, and then continually learn to diagnose more and more diseases with coming data of these new classes in the future. However, current intelligent systems are characterised by catastrophic forgetting of old knowledge when learning new classes. In this paper, we propose a new continual learning framework to alleviate this issue by simultaneously distilling both old knowledge and recently learned new knowledge and by ensembling the class-specific knowledge from the previous classifier and the learned new classifier. Experiments showed that the proposed method outperforms state-of-the-art methods on multiple medical and natural image datasets. © Springer Nature Switzerland AG 2020.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Embedding Dynamic Attributed Networks by Modeling the Evolution Processes 28

Embedding Dynamic Attributed Networks by Modeling the Evolut...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Xu, Zenan Ou, Zijing Su, Qinliang Yu, Jianxing Quan, Xiaojun Lin, Zhenkun School of Data and Computer Science Sun Yat-Sen University China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (纸本)9781952148279

Network embedding has recently emerged as a promising technique to embed nodes of a network into low-dimensional vectors. While fairly successful, most existing works focus on the embedding techniques for static networks. But in practice, there are many networks that are evolving over time and hence are dynamic, e.g., the social networks. To address this issue, a high-order spatio-temporal embedding model is developed to track the evolutions of dynamic networks. Specifically, an activeness-aware neighborhood embedding method is first proposed to extract the high-order neighborhood information at each given timestamp. Then, an embedding prediction framework is further developed to capture the temporal correlations, in which the attention mechanism is employed instead of recurrent neural networks (RNNs) for its efficiency in computing and flexibility in modeling. Extensive experiments are conducted on four real-world datasets from three different areas. It is shown that the proposed method outperforms all the baselines by a substantial margin for the tasks of dynamic link prediction and node classification, which demonstrates the effectiveness of the proposed methods on tracking the evolutions of dynamic networks. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Online Query-Based data Pricing with Time-Discounting Valuations 40

Online Query-Based Data Pricing with Time-Discounting Valuat...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Fu, Yicheng Miao, Xiaoye Peng, Huanhuan Na, Chongning Deng, Shuiguang Yin, Jianwei Zhejiang University Center for Data Science Hangzhou China Zhejiang University The State Key Lab of Brain-Machine Intelligence Hangzhou China PinTech Research Center Zhejiang Lab Hangzhou China College of Computer Science Zhejiang University Hangzhou China

ISBN: (纸本)9798350317152

Online data marketplaces emerge in diverse data-driven applications, where dynamically arriving consumers pur-chase the data at posted prices. The data value decays over time in many tasks, such as machine learning predictions and realtime systems. Existing query pricing methods do not consider the time-discounting data value. In this paper, we study the query feature-based data pricing problem with unknown time-discounting data valuation. We propose an effective online data pricing mechanism Pride to maximize the cumulative sales revenue. It leverages the powerful property of the ellipsoid method to efficiently solve online optimization via exploration and exploitation. Based on Thompson sampling, we present a novel non-stationary MAB algorithm Biased-TS to determine a suitable discount factor and attain the dynamic posted price. It is theoretically proved that, the regret upper bound order of Pride is dominated by the discretization error O(Tk), where K and T are the numbers of discount candidates and total trading rounds, respectively. Biased-TS gets a sub-linear regret upper bound O(K3√TlnT+Kexp{4√ln T}). Extensive experiments using both synthetic and real datasets demonstrate that Pride yields around 90% of the optimal cumulative revenue, and it substantially outperforms the state-of-the-art methods. © 2024 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Your Transformer May Not be as Powerful as You Expect 36

Your Transformer May Not be as Powerful as You Expect

引用

36th Conference on Neural Information Processing Systems, NeurIPS 2022

作者： Luo, Shengjie Li, Shanda Zheng, Shuxin Liu, Tie-Yan Wang, Liwei He, Di National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University China Machine Learning Department School of Computer Science Carnegie Mellon University United States Microsoft Research United States Center for Data Science Peking University China Zhejiang Lab China

ISBN: (纸本)9781713871088

Relative Positional Encoding (RPE), which encodes the relative distance between any pair of tokens, is one of the most successful modifications to the original Transformer. As far as we know, theoretical understanding of the RPE-based Transformers is largely unexplored. In this work, we mathematically analyze the power of RPE-based Transformers regarding whether the model is capable of approximating any continuous sequence-to-sequence functions. One may naturally assume the answer is in the affirmative-RPE-based Transformers are universal function approximators. However, we present a negative result by showing there exist continuous sequence-to-sequence functions that RPE-based Transformers cannot approximate no matter how deep and wide the neural network is. One key reason lies in that most RPEs are placed in the softmax attention that always generates a right stochastic matrix. This restricts the network from capturing positional information in the RPEs and limits its capacity. To overcome the problem and make the model more powerful, we first present sufficient conditions for RPE-based Transformers to achieve universal function approximation. With the theoretical guidance, we develop a novel attention module, called Universal RPE-based (URPE) Attention, which satisfies the conditions. Therefore, the corresponding URPE-based Transformers become universal function approximators. Extensive experiments covering typical architectures and tasks demonstrate that our model is parameter-efficient and can achieve superior performance to strong baselines in a wide range of applications. The code will be made publicly available at https://***/lsj2408/URPE. © 2022 Neural information processing systems foundation. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Topology analysis system for vehicular Ad Hoc network 17

Topology analysis system for vehicular Ad Hoc network

引用

17th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2016

作者： Dong, Baihong Deng, Jian Wu, Weigang Meng, Tianyu 1. School of Data and Computer Science Sun Yat-Sen Univ. China Guangdong Province Key Lab. of Big Data Analysis and Processing China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

ISBN: (纸本)9781509050819

With the development of the technology, Vehicular Ad-hoc Network is developing rapidly and continuously. And many new algorithms in VANET were put forward. For example, many people apply the Named data Networks or Software Defined Networking6 to the VANET. However, few researches are looking into the analysis of the topology of the VANET, among most of which are based on simple situations and calculation of the track of vehicles. And therefore, these analysis are inadequate for analyzing the topology under complex situations. This paper is going to put forward a new method for analyzing the change of the topology of VANET, which is capable to quantitatively analyze the change under different and complex situations. In the real experiment, when compared with traditional analysis methods, this new method can analyze more precisely the impact of some possible wireless communication problem on the change of the topology, for example, the impact of hidden node on the vehicular wireless communication and whether the number or the density of vehicles makes the topology of VANET more stable. And this new method can provide a numerical result instead of purely qualitative analysis. © 2016 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

An Experimental Survey of Missing data Imputation Algorithms (Extended Abstract) 40

An Experimental Survey of Missing Data Imputation Algorithms...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Miao, Xiaoye Wu, Yangyang Chen, Lu Gao, Yunjun Yin, Jianwei Center for Data Science Zhejiang University Hangzhou China Zhejiang University The State Key Lab of Brain-Machine Intelligence Hangzhou China Software College Zhejiang University Ningbo China College of Computer Science Zhejiang University Hangzhou China

ISBN: (纸本)9798350317152

Due to the ubiquity of missing data, data imputation has received extensive attention in the past decades. It is a well-recognized problem impacting almost all fields of scientific study. Existing imputation algorithms differ in problem settings, model selection, and data evaluation. There is a lack of systematic comparison study among imputation algorithms. In this paper, we survey this interesting and evolving research topic by broadly reviewing and experimentally comparing the state-of-the-art missing data imputation algorithms. We analyze and categorize 19 imputation algorithms. Extensive experiments over 15 real-world benchmark datasets are conducted under various settings of data types, missing mechanisms, missing rates, dataset parameters, as well as the post-imputation prediction task. We shed light on a series of constructive insights on imputation algorithms to tackle missing data problem in real-life scenarios. Moreover, we put forward promising future directions for data imputation. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Deep knn for medical image classification 23rd

Deep knn for medical image classification

引用

23rd International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2020

作者： Zhuang, Jiaxin Cai, Jiabin Wang, Ruixuan Zhang, Jianguo Zheng, Wei-Shi School of Data and Computer Science Sun Yat-sen University Guangzhou China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Key Laboratory of Machine Intelligence and Advanced Computing MOE Guangzhou China Pazhou Lab Guangzhou China

ISBN: (纸本)9783030597092

Human-level diagnostic performance from intelligent systems often depends on large set of training data. However, the amount of available data for model training may be limited for part of diseases, which would cause the widely adopted deep learning models not generalizing well. One alternative simple approach to small class prediction is the traditional k-nearest neighbor (kNN). However, due to the non-parametric characteristics of kNN, it is difficult to combine the kNN classification into the learning of feature extractor. This paper proposes an end-to-end learning strategy to unify the kNN classification and the feature extraction procedure. The basic idea is to enforce that each training sample and its K nearest neighbors belong to the same class during learning the feature extractor. Experiments on multiple small-class and class-imbalanced medical image datasets showed that the proposed deep kNN outperforms both kNN and other strong classifiers. © Springer Nature Switzerland AG 2020.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：