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

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Wentao Wang, Yexin You, Zhenbang Li, Yang Cao, Gang Yang, Zhi Cui, Bin Center for Machine Learning Research Peking University China Key Lab of High Confidence Software Technologies Peking University China Institute of Advanced Algorithms Research Shanghai China Institute of Computational Social Science Peking University Qingdao China National Engineering Labratory for Big Data Analytics and Applications China TEG Tencent Inc. Department of Data Platform China Beijing Academy of Artificial Intelligence China

ISBN: (纸本)9798350317152

Graph Neural Networks (GNNs) have achieved great success in various data mining tasks but they heavily rely on a large number of annotated nodes, requiring considerable human efforts. Despite the effectiveness of existing GNN-based Active learning (AL) methods, they assume that the annotated labels are always correct, which is contradictory to the error-prone labeling process in a practical crowdsourcing environment. Besides, due to this impractical assumption, existing works only focus on optimizing the node selection in AL but neglect optimizing the labeling process. Therefore, we present NC-ALG, the first GNN-based AL framework that optimizes both the node selection and node labeling process under a noisy crowd. For node selection, NC-ALG introduces a new measurement to model influence reliability and an effective influence maximization objective to select nodes. For node labeling, NC-ALG significantly reduces the labeling cost by considering the model-predicted labels and the labels of mirror nodes. To the best of our knowledge, this is the first attempt to consider GNN-based AL under the practical noisy crowd. Empirical studies on public datasets demonstrate that NC-ALG significantly outperforms existing methods in terms labeling efficiency. Notably, it only takes NC-ALG one-third of the labeling budget that the competitive baseline GRAIN needs to achieve an accuracy of 70.7 % on PubMed. © 2024 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Predicting Influential Higher-Order Patterns in Temporal Network data 14

Predicting Influential Higher-Order Patterns in Temporal Net...

引用

14th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2022

作者： Gote, Christoph Perri, Vincenzo Scholtes, Ingo Data Analytics Group University of Zurich Zurich Switzerland Eth Zurich Systems Design Switzerland Julius-Maximilians-Universität Würzburg Chair of Machine Learning for Complex Networks Würzburg Germany

ISBN: (纸本)9781665456616

Networks are frequently used to model complex systems comprised of interacting elements. While edges capture the topology of direct interactions, the true complexity of many systems originates from higher-order patterns in paths by which nodes can indirectly influence each other. Path data, representing ordered sequences of consecutive direct interactions, can be used to model these patterns. On the one hand, to avoid overfitting, such models should only consider those higher-order patterns for which the data provide sufficient statistical evidence. On the other hand, we hypothesise that network models, which capture only direct interactions, underfit higher-order patterns present in data. Consequently, both approaches are likely to misidentify influential nodes in complex networks. We contribute to this issue by proposing five centrality measures based on MOGen, a multi-order generative model that accounts for all indirect influences up to a maximum distance but disregards influences at higher distances. We compare MOGen-based centralities to equivalent measures for network models and path data in a prediction experiment where we aim to identify influential nodes in out-of-sample data. Our results show strong evidence supporting our hypothesis. MOGen consistently outperforms both the network model and path-based prediction. We further show that the performance difference between MOGen and the path-based approach disappears if we have sufficient observations, confirming that the error is due to overfitting. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

BIM: Improving Graph Neural Networks with Balanced Influence Maximization 40

BIM: Improving Graph Neural Networks with Balanced Influence...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Wentao Gao, Xinyi Yang, Ling Cao, Meng Huang, Ping Shan, Jiulong Yin, Hongzhi Cui, Bin Peking University Center for Machine Learning Research China Institute of Advanced Algorithms Research Shanghai China National Engineering Labratory for Big Data Analytics and Applications The University of Queensland Australia Peking University Key Lab of High Confidence Software Technologies China Apple Inc. Institute of Computational Social Science Peking University Qingdao China

ISBN: (纸本)9798350317152

The imbalanced data classification problem has aroused lots of concerns from both academia and industry since data imbalance is a widespread phenomenon in many real-world scenarios. Although this problem has been well researched from the view of imbalanced class samples, we further argue that graph neural networks (GNNs) expose a unique source of imbalance from the influenced nodes of different classes of labeled nodes, i.e., labeled nodes are imbalanced in terms of the number of nodes they influenced during the influence propagation in GNNs. To tackle this previously unexplored influence-imbalance issue, we connect social influence maximization with the imbalanced node classification problem and propose balanced influence maximization (BIM). Specifically, BIM greedily assigns the pseudo label to the node which can maximize the number of influenced nodes in GNN training while making the influence of each class more balance. Experimental results on five public datasets demonstrate the effectiveness of our method in relieving the influence-imbalance issue. For example, when training a GCN with an imbalance ratio of 0.1, BIM significantly outperforms the most competitive baseline by 0.6% -9.8% in five public datasets in terms of the F1 score. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Gaitmap - An Open Ecosystem for IMU-based Human Gait Analysis and Algorithm Benchmarking

TechRxiv

引用

TechRxiv 2023年

作者： Küderle, Arne Ullrich, Martin Roth, Nils Ollenschläger, Malte Ibrahim, Alzhraa Moradi, Hamid Richer, Robert Seifer, Ann-Kristin Zürl, Matthias Sîmpetru, Raul Herzer, Liv Prossel, Dominik Kluge, Felix Eskofier, Bjoern Friedrich-Alexander-Universität Erlangen-Nürnberg Machine Learning and Data Analytics Lab Department of Artificial Intelligence in Biomedical Engineering Germany

来源：评论

学校读者我要写书评

暂无评论

Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters

arXiv

引用

arXiv 2025年

作者： Salwig, Sebastian Kahlke, Till Hirschberger, Florian Forster, Dennis Lücke, Jörg Carl von Ossietzky University Oldenburg Faculty VI Machine Learning Oldenburg Germany Frankfurt University of Applied Sciences Faculty 3 Data Analytics and AI Frankfurt am Main Germany

Gaussian Mixture Models (GMMs) range among the most frequently used machine learning models. However, training large, general GMMs becomes computationally prohibitive for datasets with many data points N of high-dimensionality D. For GMMs with arbitrary covariances, we here derive a highly efficient variational approximation, which is integrated with mixtures of factor analyzers (MFAs). For GMMs with C components, our proposed algorithm significantly reduces runtime complexity per iteration from O(NCD2) to a complexity scaling linearly with D and remaining constant w.r.t. C. Numerical validation of this theoretical complexity reduction then shows the following: the distance evaluations required for the entire GMM optimization process scale sublinearly with NC. On large-scale benchmarks, this sublinearity results in speed-ups of an order-of-magnitude compared to the state-of-the-art. As a proof of concept, we train GMMs with over 10 billion parameters on about 100 million images, and observe training times of approximately nine hours on a single state-of-the-art CPU. Copyright © 2025, The Authors. All rights reserved.

关键词： Expectation maximization algorithm

来源：评论

学校读者我要写书评

暂无评论

An accurate detection is not all you need to combat label noise in web-noisy datasets

arXiv

引用

arXiv 2024年

作者： Albert, Paul Valmadre, Jack Arazo, Eric Krishna, Tarun O’Connor, Noel E. McGuinness, Kevin Australian Institute for Machine Learning University of Adelaide Australia CeADAR Ireland’s Centre for Applied Artificial Intelligence Ireland Insight Centre for Data Analytics Dublin City University Ireland

Training a classifier on web-crawled data demands learning algorithms that are robust to annotation errors and irrelevant examples. This paper builds upon the recent empirical observation that applying unsupervised contrastive learning to noisy, web-crawled datasets yields a feature representation under which the in-distribution (ID) and out-of-distribution (OOD) samples are linearly separable [3]. We show that direct estimation of the separating hyperplane can indeed offer an accurate detection of OOD samples, and yet, surprisingly, this detection does not translate into gains in classification accuracy. Digging deeper into this phenomenon, we discover that the near-perfect detection misses a type of clean examples that are valuable for supervised learning. These examples often represent visually simple images, which are relatively easy to identify as clean examples using standard loss- or distance-based methods despite being poorly separated from the OOD distribution using unsupervised learning. Because we further observe a low correlation with SOTA metrics, this urges us to propose a hybrid solution that alternates between noise detection using linear separation and a state-of-the-art (SOTA) small-loss approach. When combined with the SOTA algorithm PLS, we substantially improve SOTA results for real-world image classification in the presence of web noise https://***/PaulAlbert31/LSA. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Beyond the Known: Adversarial Autoencoders in Novelty Detection

arXiv

引用

arXiv 2024年

作者： Asad, Muhammad Ullah, Ihsan Sistu, Ganesh Madden, Michael G. Machine Learning Research Group School of Computer Science University of Galway Ireland Insight SFI Research Centre for Data Analytics University of Galway Ireland Valeo Vision Systems Tuam Ireland

In novelty detection, the goal is to decide if a new data point should be categorized as an inlier or an outlier, given a training dataset that primarily captures the inlier distribution. Recent approaches typically use deep encoder and decoder network frameworks to derive a reconstruction error, and employ this error either to determine a novelty score, or as the basis for a one-class classifier. In this research, we use a similar framework but with a lightweight deep network, and we adopt a probabilistic score with reconstruction error. Our methodology calculates the probability of whether the sample comes from the inlier distribution or not. This work makes two key contributions. The first is that we compute the novelty probability by linearizing the manifold that holds the structure of the inlier distribution. This allows us to interpret how the probability is distributed and can be determined in relation to the local coordinates of the manifold tangent space. The second contribution is that we improve the training protocol for the network. Our results indicate that our approach is effective at learning the target class, and it outperforms recent state-of-the-art methods on several benchmark datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Depth Estimation using Weighted-loss and Transfer learning

arXiv

引用

arXiv 2024年

作者： Hafeez, Muhammad Adeel Madden, Michael G. Sistu, Ganesh Ullah, Ihsan Machine Learning Research Group School of Computer Science University of Galway Ireland Insight SFI Research Centre for Data Analytics University of Galway Ireland Valeo Vision Systems Tuam Ireland

Depth estimation from 2D images is a common computer vision task that has applications in many fields including autonomous vehicles, scene understanding and robotics. The accuracy of a supervised depth estimation method mainly relies on the chosen loss function, the model architecture, quality of data and performance metrics. In this study, we propose a simplified and adaptable approach to improve depth estimation accuracy using transfer learning and an optimized loss function. The optimized loss function is a combination of weighted losses to which enhance robustness and generalization: Mean Absolute Error (MAE), Edge Loss and Structural Similarity Index (SSIM). We use a grid search and a random search method to find optimized weights for the losses, which leads to an improved model. We explore multiple encoder-decoder-based models including DenseNet121, DenseNet169, DenseNet201, and EfficientNet for the supervised depth estimation model on NYU Depth dataset v2. We observe that the EfficientNet model, pre-trained on ImageNet for classification when used as an encoder, with a simple upsampling decoder, gives the best results in terms of RSME, REL and log10: 0.386, 0.113 and 0.049, respectively. We also perform a qualitative analysis which illustrates that our model produces depth maps that closely resemble ground truth, even in cases where the ground truth is flawed. The results indicate significant improvements in accuracy and robustness, with EfficientNet being the most successful architecture. Copyright © 2024, The Authors. All rights reserved.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Facial Expression Recognition Using Multi-Block Deep CNN 5

Facial Expression Recognition Using Multi-Block Deep CNN

引用

5th International Conference on Circuits, Control, Communication and Computing, I4C 2024

作者： Priyadarshini, V. Srinivasulu Reddy, U. Reddy Chirra, Venkata Rami Mrudula, M. Suneetha, M. National Institute of Technology Dept. of Computer Science & Engineering Andhra Pradesh India Machine Learning & Data Analytics Lab National Institute of Technology Dept. of Computer Applications Tiruchirappalli India School of Computer Science & Engineering VIT-AP University Amaravathi India Malla Reddy College of Engineering Department of CSE Telangana India Independent Researcher Amaravati India

ISBN: (纸本)9798331528539

Emotions play a crucial role in decision-making, moral judgments, and other cognitive processes. The goal of this work is to identify people's facial emotions from face images. Facial expression recognition (FER), a highly diverse field with many commonalities between classes, is a challenging problem. The capabilities of current FER systems are limited in this regard. In this work, a multi-block Deep Convolutional Neural Networks (DCNN) model was proposed to identify facial expressions. Five blocks with different computational components were defined in a multi-block DCNN to extract the unique characteristics from input images. The second model (DCNN-SVM) is developed with an ensemble of SVM classifier to improve predictability and stability. The third model (DCNN-MV) is based on the majority voting with 4 classifiers SVM, KNN, Random Forest, and Decision Tree. The CK+ dataset was utilized and expanded via image data augmentation to enhance model performance and generalization. By adjusting hyperparameters, the suggested DCNN model's accuracy was investigated. The DCNN model reports an accuracy score of 97.71%. Both DCNN-SVM and DCNN-MV models achieved 97.79% accuracy. On the CK+ dataset, the proposed models demonstrated good accuracy in identifying facial expressions. When compared to existing models, the proposed model outperformed existing models in terms of accuracy. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Noise filtering approach to improve handwritten digit recognition using customized CNN for Cerebral Palsy individuals

引用

The European Physical Journal Special Topics 2025年 1-19页

作者： Muthureka, K. Srinivasulu Reddy, U. Janet, B. Machine Learning and Data Analytics Lab Department of Computer Applications National Institute of Technology-Tiruchirappalli Tiruchirappalli India Centre of Excellence (CoE) in Artificial Intelligence National Institute of Technology-Tiruchirappalli Tiruchirappalli India Information Processing Lab Department of Computer Applications Tiruchirappalli India

Automatic recognition of handwritten digits in people with Cerebral Palsy (CP) is a serious challenge that requires advancements in data preparation for improved predictive accuracy. The disorganized digit pixel patterns caused by CP people’ innate motor coordination problems result in the classification errors due to the noise and outlier. Despite the fact that many handwritten digit databases for normal people are available, none expressly cater to those with shaky hands/CP dataset. This highlights the importance of an efficient pre-processing method for mitigating variances in CP individuals’ digit pixel patterns. A total of 43,000 images from 43 CP people were collected and organized into 10 different folders for data labeling. The authors used the K-Means Based Noise Removal (KMNR) approach to remove noise and outliers from a CP and tested it on a customized CNN. The KMNR model achieved an accuracy of 98.86%, compared to 93.54% without it. The F1-score values for state-of-the-art models without KMNR ranged from 85.00% to 97.00%, but after integrating KMNR, they increased to 92.00% to 98.00%. The precision values ranged from 85.00% to 97.00% in the absence of KMNR, but increased to 91.00% to 98.00% in the presence of KMNR. The recall values ranged from 85.00% to 97.00% without KMNR, but increased to 87.00% to 98.00% with KMNR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：