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

IEEE International Conference on Big knowledge (ICBK)

作者： Ze Yang Changyang Tai Gongqing Wu Zan Zhang Xianyu Bao 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: (纸本)9781665438599

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.

关键词： Deep learning Conferences Clustering methods Time series analysis Clustering algorithms Benchmark testing Stability analysis

来源：评论

学校读者我要写书评

暂无评论

Sequential Solutions in Machine Scheduling Games 16th

Sequential Solutions in Machine Scheduling Games

引用

16th International Conference on Web and Internet Economics, WINE 2020

作者： Chen, Cong Giessler, Paul Mamageishvili, Akaki Mihalák, Matúš Penna, Paolo School of Business Administration South China University of Technology Guangzhou China Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Department of Management Technology and Economics ETH Zurich Zurich Switzerland Department of Computer Science ETH Zurich Zurich Switzerland

ISBN: (纸本)9783030649456

We consider the classical machine scheduling, where n jobs need to be scheduled on m machines, and where job j scheduled on machine i contributes pi,j∈ R to the load of machine i, with the goal of minimizing the makespan, i.e., the maximum load of any machine in the schedule. We study inefficiency of schedules that are obtained when jobs arrive sequentially one by one, and the jobs choose themselves the machine on which they will be scheduled, aiming at being scheduled on a machine with small load. We measure the inefficiency of a schedule as the ratio of the makespan obtained in the worst-case equilibrium schedule, and of the optimum makespan. This ratio is known as the sequential price of anarchy (SPoA). We also introduce two alternative inefficiency measures, which allow for a favorable choice of the order in which the jobs make their decisions. As our first result, we disprove the conjecture of [22] claiming that the sequential price of anarchy for m= 2 machines is at most 3. We show that the sequential price of anarchy grows at least linearly with the number n of players, assuming arbitrary tie-breaking rules. That is, we show SPoA∈ Ω(n). Complementing this result, we show that SPoA∈ O(n), reducing previously known exponential bound for 2 machines. Furthermore, we show that there exists an order of the jobs, resulting in makespan that is at most linearly larger than the optimum makespan. To the end, we show that if an authority can change the order of the jobs adaptively to the decisions made by the jobs so far (but cannot influence the decisions of the jobs), then there exists an adaptive ordering in which the jobs end up in an optimum schedule. © 2020, Springer Nature Switzerland AG.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Causal structure learning of nonlinear additive noise model based on streaming feature

Causal structure learning of nonlinear additive noise model ...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Jing Yang Gaojin Fan Anbo Shen Aiguo Wang Ministry of Education Key Laboratory of Knowledge Engineering With Big Data(Hefei University of Technology) School of Computer Science and Information Engineering Hefei University of Technology Hefei P. R. China School of Electronic and Information Engineering Foshan University China

ISBN: (纸本)9781665424288

The current streaming feature structure learning needs to be improved in the processing of nonlinear continuous data and the dynamic acquisition of causal structures. In this paper, we propose a causal structure learning algorithm, CANSF, based on the streaming feature of additive noise models. We have made three contributions. First, by using the information carried by the noise of nonlinear continuous data, we propose a real correlation identification method based on logarithmic likelihood, which can identify the real correlation and redundant features of target features, and dynamically select parent and child nodes for each feature. Second, based on regression analysis, a method to determine the causal direction is proposed, which can be used for dynamic orientation. Third, a learning method of causal structure based on streaming features is proposed, which can obtain the Causal structure diagram directly and dynamically.

关键词： Additive noise Learning systems Correlation Heuristic algorithms Conferences data models Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

Suppress content shift: better diffusion features via off-th...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Benyuan Meng Qianqian Xu Zitai Wang Zhiyong Yang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at https://***/Darkbblue/diffusion-content-shift.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Carbon-doped percentage effect on the mechanical properties of nanoporous silicon sample using molecular dynamics simulation

引用

Case Studies in Chemical and Environmental engineering 2025年 11卷

作者： Sawaran Singh, Narinderjit Singh Ali, Ali B.M. Ameen, Hawzhen Fateh M. Al-Zahiwat, Murtadha M. Salahshour, Soheil Emami, Nafiseh Faculty of Data Science and Information Technology INTI International University Persiaran Perdana BBN Putra Nilai Nilai 71800 Malaysia Air Conditioning Engineering Department College of Engineering University of Warith Al-Anbiyaa Karbala Iraq Department of Petroleum Technology Erbil Technology College Erbil Polytechnic University Kurdistan Region Erbil Iraq Department of Petroleum Engineering Knowledge University Erbil Iraq Department of Chemical engineering College of Engineering University of Misan Amarah Iraq Faculty of Engineering and Natural Sciences Istanbul Okan University Istanbul Türkiye Faculty of Engineering and Natural Sciences Bahcesehir University Istanbul Türkiye Research Center of Applied Mathematics Khazar University Baku Türkiye Fast Computing Center Shabihsazan Ati Pars Tehran Iran

Porous materials have attracted considerable attention from researchers due to its many uses in molecular separation, heterogeneous catalysis, absorption technologies, and electronic improvements. These solid materials, often defined by their structural voids, are essential in several sectors. This research investigated the impact of carbon doping on the mechanical characteristics of nanoporous silicon matrices. The use of high-purity silicon doping is very beneficial in the semiconductor industry and is crucial for high-power devices and automotive applications. This study simulates a nanoporous silicon sample by molecular dynamics methods, adding carbon doping at different concentrations. The findings demonstrate that when the carbon doping concentration escalated from 1 % to 30 %, the mechanical resistance of the system decreased correspondingly. The ultimate tensile strength fell from 10.26 to 9.02 GPa. Furthermore, Young's modulus rose from 83.47 to 98.37 GPa. The decline in mechanical stability was associated with a drop in the model's total weight, which had considerable ramifications for industrial applications. Thus, incorporating C-doped nanoporous silicon into real applications not only lowered the weight of target materials but also improved their use. © 2025 The Author(s)

关键词： Carbon doping Mechanical properties Molecular dynamics simulation Nanoporous Porous materials

来源：评论

学校读者我要写书评

暂无评论

Can we detect harmony in artistic compositions? A machine learning approach

arXiv

引用

arXiv 2020年

作者： Vandor, Adam van Vollenhoven, Marie Weiss, Gerhard Spanakis, Gerasimos Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Infinity Games Maastricht Netherlands

Harmony in visual compositions is a concept that cannot be defined or easily expressed mathematically, even by humans. The goal of the research described in this paper was to find a numerical representation of artistic compositions with different levels of harmony. We ask humans to rate a collection of grayscale images based on the harmony they convey. To represent the images, a set of special features were designed and extracted. By doing so, it became possible to assign objective measures to subjectively judged compositions. Given the ratings and the extracted features, we utilized machine learning algorithms to evaluate the efficiency of such representations in a harmony classification problem. The best performing model (SVM) achieved 80% accuracy in distinguishing between harmonic and disharmonic images, which reinforces the assumption that concept of harmony can be expressed in a mathematical way that can be assessed by humans. Copyright © 2020, The Authors. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Nondestructive Chicken Egg Fertility Detection Using CNN-Transfer Learning Algorithms

arXiv

引用

arXiv 2023年

作者： Saifullah, Shoffan Drezewski, Rafal Yudhana, Anton Pranolo, Andri Kaswijanti, Wilis Suryotomo, Andiko Putro Putra, Seno Aji Khaliduzzaman, Alin Prabuwono, Anton Satria Japkowicz, Nathalie Institute of Computer Science AGH University of Krakow Krakow30-059 Poland Department of Informatics Universitas Pembangunan Nasional Veteran Yogyakarta Yogyakarta55281 Indonesia Center of Knowledge Engineering and Data Science Department of Electrical Engineering and Informatics Universitas Negeri Malang Malang65145 Indonesia Department of Electrical Engineering Universitas Ahmad Dahlan Yogyakarta55191 Indonesia College of Computer and Information Hohai University Nanjing211100 China Department of Informatics Faculty of Industrial Technology Universitas Ahmad Dahlan Yogyakarta55166 Indonesia Faculty of Agricultural Engineering and Technology Sylhet Agricultural University Sylhet3100 Bangladesh Faculty of Computing and Information Technology in Rabigh King Abdulaziz University Jeddah21589 Saudi Arabia Department of Computer Science American University WashingtonDC20016 United States

This study explored the application of CNN-Transfer Learning for nondestructive chicken egg fertility detection for precise poultry hatchery practices. Four models, VGG16, ResNet50, InceptionNet, and MobileNet, were trained and evaluated on a dataset (200 single egg images) using augmented images (rotation, flip, scale, translation, and reflection). The training results demonstrated that all models achieved high accuracy, indicating their ability to learn and classify chicken eggs’ fertility. However, variations in accuracy and performance were observed when these models were evaluated on the testing datasets. The InceptionNet exhibited the best overall performance, accurately classifying fertile and non-fertile eggs. It demonstrated excellent performance in all parameters of the evaluation metrics for both training and testing datasets. When evaluated on the testing datasets, it achieved an accuracy of 0.98, a sensitivity of 1 for detecting fertile eggs, and a specificity of 0.96 for identifying non-fertile eggs. The higher performance is attributed to its unique architecture, efficiently capturing features at different scales, which leads to improved accuracy and robustness. Further optimization and fine-tuning of the models might be necessary to address the limitations in accurately detecting fertile and non-fertile eggs using other models. This study highlighted the potential of CNN-transfer learning for nondestructive fertility detection and emphasized the need for further research to enhance the models’ capabilities and to ensure accurate *** Codes CS-Class: 68T07, 68T45, 68U10, ICT-Class: 94A08 © 2023, CC BY-SA.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Sampling topic representative users by integrating node degree and edge weight 5

Sampling topic representative users by integrating node degr...

引用

5th IEEE International Conference on data science in Cyberspace, DSC 2020

作者： Wang, Jiangwen Ban, Zhijie Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China China Banking and Insurance Information Technology Management Co. Ltd Beijing China

ISBN: (纸本)9781728195582

Finding a subset of users to statistically represent the original social network in terms of attributes has received a lot of attention recently. The existing literature had proved that the problem is NP-Hard and proposed some sampling models, but representative degrees aren't systematically studied. Taking node degree and edge weight into account, we present a topic sampling model for the whole social network in this paper. Firstly, by statistically calculating node degrees for one real dataset, we find that one node is more likely to be a representative user if its degree is high. We then give some definitions about representative degrees. Based on statistical stratified sample, we finally give a sampling model of topic representative users who are from most or all attribute groups in the network. Experimental results show that our algorithm significantly outperforms other six baseline methods and is also effective in terms of time complexity. © 2020 IEEE.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Not all diffusion model activations have been evaluated as discriminative features 24

Not all diffusion model activations have been evaluated as d...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Benyuan Meng Qianqian Xu Zitai Wang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at https://***/Darkbblue/generic-diffusion-feature.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SVT-Net: Super Light-Weight Sparse Voxel Transformer for Large Scale Place Recognition

arXiv

引用

arXiv 2021年

作者： Fan, Zhaoxin Song, Zhenbo Liu, Hongyan Lu, Zhiwu He, Jun Du, Xiaoyong Key Laboratory of Data Engineering Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China Gaoling School of Artificial Intelligence Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China

Simultaneous Localization and Mapping (SLAM) and Autonomous Driving are becoming increasingly more important in recent years. Point cloud-based large scale place recognition is the spine of them. While many models have been proposed and have achieved acceptable performance by learning short-range local features, they always skip long-range contextual properties. Moreover, the model size also becomes a serious shackle for their wide applications. To overcome these challenges, we propose a super light-weight network model termed SVT-Net. On top of the highly efficient 3D Sparse Convolution (SP-Conv), an Atom-based Sparse Voxel Transformer (ASVT) and a Cluster-based Sparse Voxel Transformer (CSVT) are proposed respectively to learn both short-range local features and long-range contextual features. Consisting of ASVT and CSVT, SVT-Net can achieve state-of-the-art performance in terms of both recognition accuracy and running speed with a super-light model size (0.9M parameters). Meanwhile, for the purpose of further boosting efficiency, we introduce two simplified versions, which also achieve state-of-the-art performance and further reduce the model size to 0.8M and 0.4M respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：