Multi-Granularity Archaeological Dating of Chinese Bronze Dings Based on a Knowledge-Guided Relation Graph

• URL: http://arxiv.org/abs/2303.15266v3
• Date: Fri, 2 Jun 2023 05:51:39 GMT
• Title: Multi-Granularity Archaeological Dating of Chinese Bronze Dings Based on a Knowledge-Guided Relation Graph
• Authors: Rixin Zhou, Jiafu Wei, Qian Zhang, Ruihua Qi, Xi Yang, Chuntao Li
• Abstract summary: Current archaeology depends on trained experts to carry out bronze dating. We propose a learning-based approach to integrate advanced deep learning techniques and archaeological knowledge.
• Score: 5.359415272318481
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The archaeological dating of bronze dings has played a critical role in the study of ancient Chinese history. Current archaeology depends on trained experts to carry out bronze dating, which is time-consuming and labor-intensive. For such dating, in this study, we propose a learning-based approach to integrate advanced deep learning techniques and archaeological knowledge. To achieve this, we first collect a large-scale image dataset of bronze dings, which contains richer attribute information than other existing fine-grained datasets. Second, we introduce a multihead classifier and a knowledge-guided relation graph to mine the relationship between attributes and the ding era. Third, we conduct comparison experiments with various existing methods, the results of which show that our dating method achieves a state-of-the-art performance. We hope that our data and applied networks will enrich fine-grained classification research relevant to other interdisciplinary areas of expertise. The dataset and source code used are included in our supplementary materials, and will be open after submission owing to the anonymity policy. Source codes and data are available at: https://github.com/zhourixin/bronze-Ding.

Related papers

• On the Power of Source Screening for Learning Shared Feature Extractors [33.10812756558517]
  It is well understood that data sources with low relevance or poor quality may hinder representation learning.<n>We focus on the question of which data sources should be learned jointly by focusing on the traditionally deemed good'' collection of sources.<n>We find that source screening can play a central role in statistically optimal subspace estimation.
  arXiv  Detail & Related papers  (2026-02-18T01:32:10Z)
• Towards Ancient Plant Seed Classification: A Benchmark Dataset and Baseline Model [62.98256440452042]
  We construct the first Ancient Plant Seed Image Classification dataset.<n>It contains 8,340 images from 17 genus- or species-level seed categories excavated from 18 archaeological sites across China.<n>In both quantitative and qualitative analyses, our approach surpasses existing state-of-the-art image classification methods, achieving an accuracy of 90.5%.
  arXiv  Detail & Related papers  (2025-12-20T07:18:22Z)
• OpenDataArena: A Fair and Open Arena for Benchmarking Post-Training Dataset Value [74.80873109856563]
  OpenDataArena (ODA) is a holistic and open platform designed to benchmark the intrinsic value of post-training data.<n>ODA establishes a comprehensive ecosystem comprising four key pillars: (i) a unified training-evaluation pipeline that ensures fair, open comparisons across diverse models; (ii) a multi-dimensional scoring framework that profiles data quality along tens of distinct axes; and (iii) an interactive data lineage explorer to visualize dataset genealogy and dissect component sources.
  arXiv  Detail & Related papers  (2025-12-16T03:33:24Z)
• Benchmarking Recommendation, Classification, and Tracing Based on Hugging Face Knowledge Graph [17.251910893293626]
  HuggingKG is the first large-scale knowledge graph built from the Hugging Face community for ML resource management.<n>With 2.6 million nodes and 6.2 million edges, HuggingKG captures domain-specific relations and rich textual attributes.<n>HuggingBench is a multi-task benchmark with three novel test collections for IR tasks including resource recommendation, classification, and tracing.
  arXiv  Detail & Related papers  (2025-05-23T06:00:20Z)
• A High-Accuracy SSIM-based Scoring System for Coin Die Link Identification [40.407824759778784]
  This study introduces advances that promise to streamline and enhance archaeological coin analysis. First publicly accessible dataset of coin pictures (329 images) for die link detection. Novel SSIM-based scoring method for rapid and accurate discrimination of coin pairs. Evaluation of clustering techniques using our score, demonstrating near-perfect die link identification.
  arXiv  Detail & Related papers  (2025-02-03T09:23:20Z)
• Knowledge Graphs: The Future of Data Integration and Insightful Discovery [0.0]
  Knowledge graphs organize data by linking points, enabling researchers to combine diverse information sources into a single database. They capture complex relationships inherent in unstructured data sources, offering a semantic framework for diverse entities. Strategies for developing knowledge graphs include using seed data, named entity recognition, and relationship extraction.
  arXiv  Detail & Related papers  (2024-12-17T19:49:33Z)
• ShiftedBronzes: Benchmarking and Analysis of Domain Fine-Grained Classification in Open-World Settings [5.144974645567005]
  ShiftedBronzes is a benchmark dataset for fine-grained bronze ware dating. ShiftedBronzes incorporates two types of bronze ware data and seven types of OOD data. We conduct experiments on ShiftedBronzes and five commonly used general OOD datasets.
  arXiv  Detail & Related papers  (2024-12-17T08:56:59Z)
• Query of CC: Unearthing Large Scale Domain-Specific Knowledge from Public Corpora [104.16648246740543]
  We propose an efficient data collection method based on large language models. The method bootstraps seed information through a large language model and retrieves related data from public corpora. It not only collects knowledge-related data for specific domains but unearths the data with potential reasoning procedures.
  arXiv  Detail & Related papers  (2024-01-26T03:38:23Z)
• Capture the Flag: Uncovering Data Insights with Large Language Models [90.47038584812925]
  This study explores the potential of using Large Language Models (LLMs) to automate the discovery of insights in data. We propose a new evaluation methodology based on a "capture the flag" principle, measuring the ability of such models to recognize meaningful and pertinent information (flags) in a dataset.
  arXiv  Detail & Related papers  (2023-12-21T14:20:06Z)
• Incorporating Domain Knowledge Graph into Multimodal Movie Genre Classification with Self-Supervised Attention and Contrastive Learning [14.729059909487072]
  We present a novel framework that exploits the knowledge graph from various perspectives to address the above problems. We introduce an Attention Teacher module for reliable attention allocation based on self-supervised learning. Finally, a Genre-Centroid Anchored Contrastive Learning module is proposed to strengthen the discriminative ability of fused features.
  arXiv  Detail & Related papers  (2023-10-12T04:49:11Z)
• Towards Long-Tailed Recognition for Graph Classification via Collaborative Experts [10.99232053983369]
  We propose a novel long-tailed graph-level classification framework via Collaborative Multi-expert Learning (CoMe) To equilibrate the contributions of head and tail classes, we first develop balanced contrastive learning from the view of representation learning. We execute gated fusion and disentangled knowledge distillation among the multiple experts to promote the collaboration in a multi-expert framework.
  arXiv  Detail & Related papers  (2023-08-31T10:12:32Z)
• Knowledge-Enhanced Relation Extraction Dataset [8.612433805862619]
  There is currently no public dataset that encompasses both evidence sentences and knowledge graphs for knowledge-enhanced relation extraction. We introduce the Knowledge-Enhanced Relation Extraction dataset (KERED) KERED annotates each sentence with a relational fact, and it provides knowledge context for entities through entity linking.
  arXiv  Detail & Related papers  (2022-10-19T13:23:10Z)
• Can I see an Example? Active Learning the Long Tail of Attributes and Relations [64.50739983632006]
  We introduce a novel incremental active learning framework that asks for attributes and relations in visual scenes. While conventional active learning methods ask for labels of specific examples, we flip this framing to allow agents to ask for examples from specific categories. Using this framing, we introduce an active sampling method that asks for examples from the tail of the data distribution and show that it outperforms classical active learning methods on Visual Genome.
  arXiv  Detail & Related papers  (2022-03-11T19:28:19Z)
• Deep Transfer Learning for Multi-source Entity Linkage via Domain Adaptation [63.24594955429465]
  Multi-source entity linkage is critical in high-impact applications such as data cleaning and user stitching. AdaMEL is a deep transfer learning framework that learns generic high-level knowledge to perform multi-source entity linkage. Our framework achieves state-of-the-art results with 8.21% improvement on average over methods based on supervised learning.
  arXiv  Detail & Related papers  (2021-10-27T15:20:41Z)
• Combining Feature and Instance Attribution to Detect Artifacts [62.63504976810927]
  We propose methods to facilitate identification of training data artifacts. We show that this proposed training-feature attribution approach can be used to uncover artifacts in training data. We execute a small user study to evaluate whether these methods are useful to NLP researchers in practice.
  arXiv  Detail & Related papers  (2021-07-01T09:26:13Z)
• Inferential Text Generation with Multiple Knowledge Sources and Meta-Learning [117.23425857240679]
  We study the problem of generating inferential texts of events for a variety of commonsense like textitif-else relations. Existing approaches typically use limited evidence from training examples and learn for each relation individually. In this work, we use multiple knowledge sources as fuels for the model.
  arXiv  Detail & Related papers  (2020-04-07T01:49:18Z)
• Knowledge graph based methods for record linkage [0.0]
  We propose the knowledge graph use to tackle record linkage task. The proposed method, named bf WERL, takes advantage of the main knowledge graph properties and learns embedding vectors to encode census information. We have evaluated this method on benchmark data sets and we have compared it to related methods with stimulating and satisfactory results.
  arXiv  Detail & Related papers  (2020-03-06T11:09:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.