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

丛书名： Lecture Notes in computer science

1000年

作者： Gregor Engels Claus Lewerentz Wilhelm Schäfer Andy Schürr Bernhard Westfechtel

Price Estimation of Used Cars Using Machine Learning Algorithms 3rd

学校读者我要写书评

暂无评论

Price Estimation of Used Cars Using Machine Learning Algorit...

3rd EAI International Conference on Cognitive Computing and Cyber Physical systems, IC4S 2022

作者： Valarmathi, B. Gupta, N. Srinivasa Santhi, K. Chellatamilan, T. Kavitha, A. Raahil, Armaan Padmavathy, N. Department of Software and Systems Engineering School of Information Technology and Engineering Vellore Institute of Technology Tamil Nadu Vellore India Department of Manufacturing Engineering School of Mechanical Engineering Vellore Institute of Technology Tamil Nadu Vellore India Department of Analytics School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu Vellore India Department of Mathematics School of Advanced Sciences Vellore Institute of Technology Tamil Nadu Vellore India Department of Information Technology School of Information Technology and Engineering Vellore Institute of Technology Tamil Nadu Vellore India Department of Electronics and Communication Engineering Vishnu Institute of Technology Andhra Pradesh Bhimavaram India

ISBN: (纸本)9783031289743

In this study, machine learning (ML) techniques are employed to predict used car prices. Several features are used to calculate the price of used cars, but in this paper, we find efficient ways to find the most precise car prices. Despite the fact that there are websites offering this service, they could not employ the most precise prediction system. It is also possible to predict a used car's true market value using a variety of models and techniques. It's important to understand their genuine market value before buying or selling. Both buyers and sellers will be benefitted from these accurate predictions. Support Vector regression, Random Forest regression, and CatBoost regression techniques are used in the proposed system. In the existing method [13], mean absolute error for decision tree regression was 0.6711, which was the least among other algorithms like Linear regression, Lasso regression, Ridge regression, Bayesian Ridge regression, and etc., they used. In the proposed system, mean absolute error (MAE) for Support Vector regression, CatBoost regression and Random Forest regression techniques are 0.1459, 0.1371 and 0.1284 respectively. The prices of second hand/used cars are predicted using the CatBoost regression, Support Vector regression, and Random Forest regression techniques. The accuracy of these algorithms are 86.28%, 85.40% and 87.16%. Among these three algorithms, Random Forest regression gives the least MAE of 0.1317 and the highest accuracy of 87.16%. © 2023, ICST Institute for computer sciences, Social Informatics and Telecommunications engineering.

关键词： Forecasting

Multi-Unit Floor Plan Recognition and Reconstruction Using Improved Semantic Segmentation of Raster-Wise Floor Plans

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kratochvila, Lukas de Jong, Gijs Arkesteijn, Monique Bilík, Šimon Zemčík, Tomáš Horak, Karel Rellermeyer, Jan S. Department of Control and Instrumentation Faculty of Electrical Engineering and Communication Brno University of Technology Brno Czech Republic Department of Software Technology Faculty of Electrical Engineering Mathematics and Computer Science TU Delft Delft Netherlands Department of Management in the Built Environment Faculty of Architecture and the Built Environment TU Delft Delft Netherlands Computer Vision and Pattern Recognition Laboratory Department of Computational Engineering Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland Dependable and Scalable Software Systems Institute of Systems Engineering Faculty of Electrical Engineering and Computer Science Leibniz University Hannover Hannover Germany

Digital twins have a major potential to form a significant part of urban management in emergency planning, as they allow more efficient designing of the escape routes, better orientation in exceptional situations, and faster rescue intervention. Nevertheless, creating the twins still remains a largely manual effort, due to a lack of 3D-representations, which are available only in limited amounts for some new buildings. Thus, in this paper we aim to synthesize 3D information from commonly available 2D architectural floor plans. We propose two novel pixel-wise segmentation methods based on the MDA-Unet and MACU-Net architectures with improved skip connections, an attention mechanism, and a training objective together with a reconstruction part of the pipeline, which vectorizes the segmented plans to create a 3D model. The proposed methods are compared with two other state-of-the-art techniques and several benchmark datasets. On the commonly used CubiCasa benchmark dataset, our methods have achieved the mean F1 score of 0.86 over five examined classes, outperforming the other pixel-wise approaches tested. We have also made our code publicly available to support research in the field. © 2024, CC BY.

关键词： Semantic Segmentation

F2A2: flexible fully-decentralized approximate actor-critic for cooperative multi-agent reinforcement learning

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2023年第1期24卷 8447-8521页

作者： Wenhao Li Bo Jin Xiangfeng Wang Junchi Yan Hongyuan Zha School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of Software Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China School of Computer Science and Technology Key Laboratory of Mathematics and Engineering Applications Ministry of Education East China Normal University Shanghai China Department of Computer Science and Engineering Key Laboratory of Artificial Intelligence Ministry of Education Shanghai Jiao Tong University Shanghai China

Traditional centralized multi-agent reinforcement learning (MARL) algorithms are sometimes unpractical in complicated applications due to non-interactivity between agents, the curse of dimensionality, and computation complexity. Hence, several decentralized MARL algorithms are motivated. However, existing decentralized methods only handle the fully cooperative setting where massive information needs to be transmitted in training. The block coordinate gradient descent scheme they used for successive independent actor and critic steps can simplify the calculation, but it causes serious bias. This paper proposes a exible fully decentralized actor-critic MARL framework, which can combine most of the actor-critic methods and handle large-scale general cooperative multi-agent settings. A primal-dual hybrid gradient descent type algorithm framework is designed to learn individual agents separately for decentralization. From the perspective of each agent, policy improvement and value evaluation are jointly optimized, which can stabilize multi-agent policy learning. Furthermore, the proposed framework can achieve scalability and stability for the large-scale environment. This framework also reduces information transmission by the parameter sharing mechanism and novel modeling-other-agents methods based on theory-of-mind and online supervised learning. Sufficient experiments in cooperative Multi-agent Particle Environment and StarCraft II show that the proposed decentralized MARL instantiation algorithms perform competitively against conventional centralized and decentralized methods.

关键词： cooperative MARL decentralized actor-critic primal-dual method

Achieving adaptation for adaptive systems via runtime verification: A model-driven approach

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Yang, Zhuoqun Jin, Zhi Li, Zhi Institute of Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Haidian Dstr. Beijing100190 China Peking University Haidian Dstr. Beijing100871 China Software Engineering Dept. College of Computer Science and Information Technology Guangxi Normal University Guilin Guangxi541004 China

Self-adaptive systems (SASs) are capable of adjusting its behavior in response to meaningful changes in the operational context and itself. The adaptation needs to be performed automatically through self-managed reactions and decision-making processes at runtime. To support this kind of automatic behavior, SASs must be endowed by a rich runtime support that can detect requirements violations and reason about adaptation decisions. Requirements engineering for SASs primarily aims to model adaptation logic and mechanisms. Requirements models will guide the design decisions and runtime behaviors of system-to-be. This paper proposes a model-driven approach for achieving adaptation against non-functional requirements (NFRs), i.e. reliability and performances. The approach begins with the models in RE stage and provides runtime support for self-adaptation. We capture adaptation mechanisms as graphical elements in the goal model. By assigning reliability and performance attributes to related system tasks, we derive the tagged sequential diagram for specifying the reliability and performances of system behaviors. To formalize system behavior, we transform the requirements model to the corresponding behavior model, expressed by Label Transition systems (LTS). To analyze the reliability requirements and performance requirements, we merged the sequential diagram and LTS to a variable Discrete-Time Markov Chains (DTMC) and a variable Continuous-Time Markov Chains (CTMC) respectively. Adaptation candidates are characterized by the variable states. The optimal decision is derived by verifying the concerned NFRs and reducing the decision space. Our approach is implemented through the demonstration of a mobile information *** Codes 68N30 Copyright © 2017, The Authors. All rights reserved.

关键词： Adaptive systems

Accelerating Real-Time Imaging for Radiotherapy: Leveraging Multi-GPU Training with PyTorch 22

学校读者我要写书评

暂无评论

Accelerating Real-Time Imaging for Radiotherapy: Leveraging ...

22nd IEEE International Conference on Machine Learning and Applications, ICMLA 2023

作者： Obe, Ruth Kaufmann, Brandt Baird, Kaelen Kadel, Sam Soltani, Yasmin Cham, Mostafa Gobbert, Matthias K. Barajas, Carlos A. Jiang, Zhuoran Sharma, Vijay R. Ren, Lei Peterson, Stephen W. Poif, Jerimy C. U. of Houston-Clear Lake Dept. of Computer Science and of Software Engineering United States U. of San Francisco Dept. of Mathematics and Statistics United States Skidmore College Dept. of Computer Science and of Mathematics United States Mount Holyoke College Dept. of Computer Science and of Psychology United States U. of Houston Dept. of Biomedical Engineering United States U. of Maryland Dept. of Information Systems Baltimore County United States U. of Maryland Dept. of Mathematics and Statistics Baltimore County United States Medical Physics Graduate Program Duke University United States U. of Maryland School of Medicine Dept. of Radiation Oncology United States U. of Maryland School of Medicine Department of Radiation Oncology United States U. of Cape Town Dept. of Physics South Africa H3D Inc. United States

ISBN: (纸本)9798350345346

Proton beam therapy is an advanced form of cancer radiotherapy that uses high-energy proton beams to deliver precise and targeted radiation to tumors. This helps to mit-igate unnecessary radiation exposure in healthy tissues. Real-time imaging of prompt gamma rays with Compton cameras has been suggested to improve therapy efficacy. However, the camera's non-zero time resolution leads to incorrect interaction classifications and noisy images that are insufficient for accurately assessing proton delivery in patients. To address the challenges posed by the Compton camera's image quality, machine learning techniques are employed to classify and refine the generated data. These machine-learning techniques include recurrent and feedforward neural networks. A PyTorch model was designed to improve the data captured by the Compton camera. This decision was driven by PyTorch's flexibility, powerful capabilities in handling sequential data, and enhanced G PU usage. This accelerates the model's computations on large-scale radiotherapy data. Through hyperparameter tuning, the validation accuracy of our PyTorch model has been improved from an initial 7 % to over 60 %. Moreover, the PyTorch Distributed Data Parallelism strategy was used to train the RNN models on multiple G PU s, which significantly reduced the training time with a minor impact on model accuracy. © 2023 IEEE.

关键词： Clas-sification Compton camera Distributed Data Parallelism Proton beam therapy PyTorch Recurrent neural network

CM-MLP: Cascade Multi-scale MLP with Axial Context Relation Encoder for Edge Segmentation of Medical Image

学校读者我要写书评

暂无评论

CM-MLP: Cascade Multi-scale MLP with Axial Context Relation ...

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Lv, Jinkai Hu, Yuyong Fu, Quanshui Zhang, Zhiwang Hu, Yuqiang Lv, Lin Yang, Guoqing Li, Jinpeng Zhao, Yi Henan Institute of Advanced Technology Zhengzhou University Zhengzhou China The Research Center for Ubiquitous Computing Systems Institute of Computing Technology Chinese Academy of Sciences Beijing China Suining Central Hospital Suining China Hwa Mei Hospital University of Chinese Academy of Sciences Ningbo China School of Electrical and Information Engineering The University of Sydney Sydney Australia School of Mathematics and Computer Sciences NanChang University Nanchang China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781665468190

The convolutional-based methods provide good segmentation performance in the medical image segmentation task. However, those methods have the following challenges when dealing with the edges of the medical images: (1) Previous convolutional-based methods do not focus on the boundary relationship between foreground and background around the segmentation edge, which leads to the degradation of segmentation performance when the edge changes complexly. (2) The inductive bias of the convolutional layer cannot be adapted to complex edge changes and the aggregation of multiple-segmented areas, resulting in its performance improvement mostly limited to segmenting the body of segmented areas instead of the edge. To address these challenges, we propose the CM-MLP framework on MFI (Multiscale Feature Interaction) block and ACRE (axial context relation encoder) block for accurate segmentation of the edge of medical image. In the MFI block, we propose the cascade multi-scale MLP (Cascade MLP) to process all local information from the deeper layers of the network simultaneously and utilize a cascade multiscale mechanism to fuse discrete local information gradually. Then, the ACRE block is used to make the deep supervision focus on exploring the boundary relationship between foreground and background to modify the edge of the medical image. The segmentation accuracy (Dice) of our proposed CM-MLP framework reaches 96.96%, 96.76%, and 82.54% on three benchmark datasets: CVC-ClinicDB dataset, sub-Kvasir dataset, and our inhouse dataset, respectively, which significantly outperform the state-of-the-art method. The source code and trained models will be available at https://***/ProgrammerHyy/CM-MLP. © 2022 IEEE.

关键词： Semantic Segmentation

Classification and retrieval of digital pathology scans: A new dataset

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Babaie, Morteza Kalra, Shivam Sriram, Aditya Mitcheltree, Christopher Zhu, Shujin Khatami, Amin Rahnamayan, Shahryar Tizhoosh, H.R. KIMIA Lab University of Waterloo Canada Mathematics and Computer Science Amirkabir University Tehran Iran Electrical and Computer Engineering University of Waterloo Canada School of Electronic & Optical Eng. Nanjing University of Science & Technology Jiangsu China Institute for Intelligent Systems Research and Innovation Deakin University Australia Electrical Computer and Software Engineering University of Ontario Institute of Technology Oshawa Canada

In this paper, we introduce a new dataset, Kimia Path24, for image classification and retrieval in digital pathology. We use the whole scan images of 24 different tissue textures to generate 1,325 test patches of size 1000×1000 (0.5mm×0.5mm). Training data can be generated according to preferences of algorithm designer and can range from approximately 27,000 to over 50,000 patches if the preset parameters are adopted. We propose a compound patch- and-scan accuracy measurement that makes achieving high accuracies quite challenging. In addition, we set the benchmarking line by applying LBP, dictionary approach and convolutional neural nets (CNNs) and report their results. The highest accuracy was 41.80% for CNN. Copyright © 2017, The Authors. All rights reserved.

关键词： Classification (of information)

Modeling uncertainty and evolving self-adaptive software: A fuzzy theory based requirements engineering approach

学校读者我要写书评

暂无评论

arXiv 2017年

By comparing the accuracy performance and time performance of these schemas, we show the availability in modeling and reasoning over uncertainties. It also shows the inconsistencies between users’ preferences and prior knowledge at RE stage, which can be diminished through learning with our approach. Besides, our approach can be used as a solution to reasoning over continuously ***-adaptive software (SAS) is capable of adjusting its behavior in response to meaningful changes in the operational context and itself. Due to the inherent volatility of the open and changeable environment in which SAS is embedded, the ability of adaptation is highly demanded by many software-intensive systems. Two concerns, i.e., the requirements uncertainty and the context uncertainty are most important among others at Requirements engineering (RE) stage. However, requirements analyzers can hardly figure out the mathematical relation between requirements, system behavior and context, especially for complex and nonlinear systems, due to the existence of above uncertainties, misunderstanding and ambiguity of prior knowledge. An essential issue to be addressed is how to model and specify these uncertainties at RE stage and how to utilize the prior knowledge to achieve *** this paper, we propose a fuzzy-based approach to modeling uncertainty and achieving evolution. The approach introduces specifications to describe fuzziness. Based on the specifications, we derive a series of reasoning rules as knowledge base for achieving adaptation and evolution. These two targets are implemented through four reasoning schemas from a control theory perspective. Specifically, forward reasoning schema is used for direct adaptation;backward reasoning schema is used for optimal adaptation. Parameter-identified schema implements learning evolution by considering SAS as the gray-box system, while system-identified reasoning schema implements learning evolution by considering SAS as the gray-

关键词： Requirements engineering

Device Activity Detection in mMTC with Low-Resolution ADC: A New Protocol

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Zhaorui Liu, Ya-Feng Wang, Ziyue Liu, Liang Pan, Haoyuan Cui, Shuguang The Future Network of Intelligence Institute The School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong College of Computer Science and Software Engineering Shenzhen University Shenzhen China

This paper investigates the effect of low-resolution analog-to-digital converters (ADCs) on device activity detection in massive machine-type communications (mMTC). The low-resolution ADCs induce two challenges on the device activity detection compared with the traditional setup with the assumption of infinite ADC resolution. First, the codebook design for signal quantization by the low-resolution ADC is particularly important since a good design of the codebook can lead to small quantization error on the received signal, which in turn has significant influence on the activity detector performance. To this end, prior information about the received signal power is needed, which depends on the number of active devices K. This is sharply different from the activity detection problem in traditional setups, in which the knowledge of K is not required by the BS as a prerequisite. Second, the covariance-based approach achieves good activity detection performance in traditional setups while it is not clear if it can still achieve good performance in this paper. To solve the above challenges, we propose a communication protocol that consists of an estimator for K and a detector for active device identities: 1) For the estimator, the technical difficulty is that the design of the ADC quantizer and the estimation of K are closely intertwined and doing one needs the information/execution from the other. We propose a progressive estimator which iteratively performs the estimation of K and the design of the ADC quantizer;2) For the activity detector, we propose a custom-designed stochastic gradient descent algorithm to estimate the active device identities. Numerical results demonstrate the effectiveness of the communication protocol. © 2023, CC BY.

关键词： Stochastic systems