arxiv.org/abs/0912.1767v1
The profusion of online digital images presents new challenges for image indexing. Images have always been problematic to describe and catalogue due to lack of inherent textual data and ambiguity of meaning. An alternative to time-consuming profess...
en.wikipedia.org/wiki/Climate_of_Melbourne
classification Cfb), with warm summers and cool, damp winters. Melbourne is well known for its changeable weather conditions, mainly due to it being located on the
arxiv.org/abs/2505.19358v1
Natural disasters are increasing in frequency and severity, causing hundreds of billions of dollars in damage annually and posing growing threats to infrastructure and human livelihoods. Accurate data on roofing materials is critical for modeling bui...
arxiv.org/abs/2211.17228v2
Evaluating neural network performance is critical to deep neural network design but a costly procedure. Neural predictors provide an efficient solution by treating architectures as samples and learning to estimate their performance on a given task. H...
arxiv.org/abs/2304.01457v2
Vision-Language models (VLMs) that use contrastive language-image pre-training have shown promising zero-shot classification performance. However, their performance on imbalanced dataset is relatively poor, where the distribution of classes in the tr...
arxiv.org/abs/1607.03138v3
We describe solutions to the problem of elementary classification in the class of group algebras of free groups. We will show that unlike free groups, two group algebras of free groups over infinite fields are elementarily equivalent if and only if t...
arxiv.org/abs/1412.7779v1
Flat plumbing basket surfaces of links were introduced to study the geometry of the complement of the links. In present article, we study links of the flat plumbing basket numbers $4$ or less using a special presentation of the flat plumbing basket s...
arxiv.org/abs/1510.00779v1
Let $\mathbf{Y}$ be the solution space of an $n$-layer cellular neural network, and let $\mathbf{Y}^{(i)}$ and $\mathbf{Y}^{(j)}$ be the hidden spaces, where $1 \leq i, j \leq n$. ($\mathbf{Y}^{(n)}$ is called the output space.) The classification an...
arxiv.org/abs/2308.12584v1
Handling entirely unknown data is a challenge for any deployed classifier. Classification models are typically trained on a static pre-defined dataset and are kept in the dark for the open unassigned feature space. As a result, they struggle to deal...
arxiv.org/abs/2010.08541v1
We classify principal blocks of finite groups with semidihedral defect groups up to splendid Morita equivalence. This completes the classification of all principal $2$-blocks of tame representation type up to splendid Morita equivalence and shows tha...
arxiv.org/abs/2501.07925v1
Safety is the main concern in the aviation industry, where even minor operational issues can lead to serious consequences. This study addresses the need for comprehensive aviation accident analysis by leveraging natural language processing (NLP) and...
arxiv.org/abs/1910.04115v3
Many machine learning tasks such as clustering, classification, and dataset search benefit from embedding data points in a space where distances reflect notions of relative similarity as perceived by humans. A common way to construct such an embeddin...
arxiv.org/abs/2409.11644v1
Tuberculosis (TB) is caused by the bacterium Mycobacterium tuberculosis, primarily affecting the lungs. Early detection is crucial for improving treatment effectiveness and reducing transmission risk. Artificial intelligence (AI), particularly throug...
arxiv.org/abs/2110.09003v3
Koh and Tay proved a fundamental classification of $G$ vertex-multiplications into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\mathscr{C}_2$. They also showed that any vertex-multiplication of a tree with diameter at least 3 does not belong to...
arxiv.org/abs/2010.02792v2
Koh and Tay proved a fundamental classification of $G$ vertex-multiplications into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\mathscr{C}_2$. In this paper, we prove that vertex-multiplications of cartesian products of graphs $G\times H$ lie i...
arxiv.org/abs/2007.06399v1
Koh and Tay introduced a new family of graphs, $G$ vertex-multiplications, as an extension of complete $n$-partite graphs. They proved a fundamental classification of $G$ vertex-multiplications into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\...
arxiv.org/abs/2301.09036v1
We obtain the formulae for the numbers of 4-matchings and 5-matchings in terms of the number of hexagonal faces in (4, 6)-fullerene graphs by studying structural classification of 6-cycles and some local structural properties, which correct the corre...
arxiv.org/abs/1610.03996v1
We describe the solution of team ISMLL for the ECML-PKDD 2016 Discovery Challenge on Bank Card Usage for both tasks. Our solution is based on three pillars. Gradient boosted decision trees as a strong regression and classification model, an intensive...
arxiv.org/abs/2203.06951v3
Marine scientists use remote underwater video recording to survey fish species in their natural habitats. This helps them understand and predict how fish respond to climate change, habitat degradation, and fishing pressure. This information is essent...
arxiv.org/abs/1204.5164v1
A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and 14 is given, and a new parametrization scheme for obtaining new examples of affine parametric families of complex Hadamard matrices is provided. On the one hand, i...