In modern society, the number of households raising pets is increasing. As pet ownership increases, the cost of treating companion cats is also rising, with a significant portion of these costs going toward the treatm...
详细信息
Skin diseases in companion cats can worsen if not treated promptly, and this can increase the financial burden on pet owners. To prevent this, early and accurate diagnosis is essential. This study introduces a deep le...
详细信息
Low back pain is a leading cause of disability globally, is often associated with degenerative lumbar spine conditions. Accurate diagnosis of these conditions is critical but challenging due to the subjective nature o...
详细信息
Semantic segmentation is a core task in computer vision that allows AI models to interact and understand their surrounding environment. Similarly to how humans subconsciously segment scenes, this ability is crucial fo...
详细信息
Semantic segmentation is a core task in computer vision that allows AI models to interact and understand their surrounding environment. Similarly to how humans subconsciously segment scenes, this ability is crucial for scene understanding. However, a challenge many semantic learning models face is the lack of data. Existing video datasets are limited to short, low-resolution videos that are not representative of real-world examples. Thus, one of our key contributions is a customized semantic segmentation version of the Walking Tours dataset that features hour-long, high-resolution, real-world data from tours of different cities. Additionally, we evaluate the performance of open-vocabulary, semantic model OpenSeeD on our own custom dataset and discuss future implications.
Real-time traffic monitoring is crucial for efficient transportation management, but it poses significant computational challenges, particularly when dealing with high-resolution videos. Most modern traffic monitoring...
详细信息
In this article, we investigate an intelligent ground penetrating radar (GPR) that facilitates root-zone soil moisture estimation, a key parameter in precision agriculture. To create an intelligent GPR, we must train ...
详细信息
As learning-to-rank models are increasingly deployed for decision-making in areas with profound life implications, the FairML community has been developing fair learning-to-rank (LTR) models. These models rely on the ...
As learning-to-rank models are increasingly deployed for decision-making in areas with profound life implications, the FairML community has been developing fair learning-to-rank (LTR) models. These models rely on the availability of sensitive demographic features such as race or sex. However, in practice, regulatory obstacles and privacy concerns protect this data from collection and use. As a result, practitioners may either need to promote fairness despite the absence of these features or turn to demographic inference tools to attempt to infer them. Given that these tools are fallible, this paper aims to further understand how errors in demographic inference impact the fairness performance of popular fair LTR strategies. In which cases would it be better to keep such demographic attributes hidden from models versus infer them? We examine a spectrum of fair LTR strategies ranging from fair LTR with and without demographic features hidden versus inferred to fairness-unaware LTR followed by fair re-ranking. We conduct a controlled empirical investigation modeling different levels of inference errors by systematically perturbing the inferred sensitive attribute. We also perform three case studies with real-world datasets and popular open-source inference methods. Our findings reveal that as inference noise grows, LTR-based methods that incorporate fairness considerations into the learning process may increase bias. In contrast, fair re-ranking strategies are more robust to inference errors. All source code, data, and experimental artifacts of our experimental study are available here: https://***/sewen007/***
Tree Editing Distance is a widely applied quantity for measuring the similarity between hierarchical data structures, particularly trees. This paper reinterprets the TED problem using group action theory, exploring th...
详细信息
ISBN:
(数字)9798331521165
ISBN:
(纸本)9798331521172
Tree Editing Distance is a widely applied quantity for measuring the similarity between hierarchical data structures, particularly trees. This paper reinterprets the TED problem using group action theory, exploring the connection between tree editing operations and permutation groups. By formulating node insertion, deletion, and relabeling as group actions, we offer a novel perspective on tree transformations. This group-theoretic and metric-based approach provides new insights into the structure of tree similarity and introduces new possibilities for TED applications in various fields.
In this article, we revisit the well-studied problem of mean estimation under user-level Ε-differential privacy (DP). While user-level Ε-DP mechanisms for mean estimation, which typically bound (or clip) user contri...
详细信息
We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, th...
详细信息
暂无评论