<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Tool for Price Prediction from Unstructured Damage Reports</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hamid Ahaggach</string-name>
          <email>Hamid.ahaggach@u-bourgogne.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lylia Abrouk</string-name>
          <email>lylia.abrouk@u-bourgogne.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eric Lebon</string-name>
          <email>elebon@syartec.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LIB Laboratory, University of Burgundy</institution>
          ,
          <addr-line>Dijon</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Syartec</institution>
          ,
          <addr-line>Aix-en-Provence</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the automotive industry, accurately estimating the cost of repairing car damages is crucial for both customers and service providers. The process of manually analyzing unstructured reports describing car damage and predicting repair prices is time-consuming and prone to errors. To address this challenge, prediction of repair prices from unstructured damage descriptions.</p>
      </abstract>
      <kwd-group>
        <kwd>Cost estimation</kwd>
        <kwd>machine learning</kwd>
        <kwd>natural language processing</kwd>
        <kwd>entity extraction</kwd>
        <kwd>relationship extraction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        The automotive industry faces numerous challenges [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], and one of them revolves around the
eficient and accurate estimation of car repair damages. During vehicle transportation, damages
may occur. To ensure quality control, every vehicle undergoes inspection, and any identified
damages are documented in a car damage report. However, the estimation process is complicated
by the unstructured nature of these reports. The manual estimation process for repair costs has
been time-consuming and error-prone, relying heavily on manual analysis and interpretation.
In response to this problem, we created a software tool called  
. This advanced tool
aims to automate the estimation of repair costs. To the best of our knowledge, there are no
other applications currently available in this domain, making  
unique solution in this field. The primary objective of  
a groundbreaking and
is to automatically analyze and
extract relevant information from the unstructured car damage reports. By using named entities
recognition and relation extraction techniques, the tool is capable of extracting entities and
relationships from textual descriptions of car damages. This structured data is then utilized to
train a regression model that predicts the approximate cost of repairing the reported damages.
CEUR
Workshop
Proceedings
      </p>
      <p>In the following sections, we will delve deeper into the functionality and capabilities of
  . We will explore how the tool leverages machine learning and natural language
processing techniques to analyze and extract crucial information from the unstructured insurance
reports. Furthermore, we will present the results of estimation repair price.</p>
    </sec>
    <sec id="sec-3">
      <title>2. CarDRP Tool</title>
      <p>In this section, we will provide a detailed overview of the two main phases of our  
tool.</p>
      <sec id="sec-3-1">
        <title>2.1. Information Structuring</title>
        <p>The first phase of   involves the crucial task of structuring the information extracted
from the unstructured reports. In this phase, the tool utilizes natural language processing
techniques to analyze and understand the textual descriptions of car damages. It extracts
entities such as the type of damage (e.g., dented bumper, cracked windshield), its severity, and
relevant attributes (e.g., location, size). Furthermore, the tool establishes relationships between
these entities to provide a comprehensive understanding of the reported damages.</p>
        <sec id="sec-3-1-1">
          <title>2.1.1. Named Entity Recognition</title>
          <p>
            Named Entity Recognition (NER) is a task in natural language processing that involves
identifying and recognize named entities in text. There are several approaches to NER, including:
rule-based approach, dictionaries approach, machine learning and, deep learning [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ]. The aim
of NER is to label specific entities, such as names of people, organizations, and other predefined
categories. In the context of   , NER is utilized to identify and extract named entities
related to car damages, car parts, damage location etc. In the task of NER, we compare
different machine learning algorithms such as CRF [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ], BILSTM [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ], FlauBERT [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ], etc. and we
select the best model, in our case, we have chosen SpaCy NER model. SpaCy1 is a powerful
natural language processing library that ofers advanced features for entity recognition and
text processing. SpaCy utilizes a combination of rule-based matching, statistical models, and
deep learning techniques to identify and classify entities in text. It uses pre-trained models and
custom training data to achieve accurate and eficient entity extraction. We fine-tuned 
NER model with 1000 iterations, a ℎ _ of 32, a   rate of 0.35, and the  optimizer.
          </p>
          <p>To evaluate the performance of the models, we measure various metrics such as F1 score,
precision, and recall. Table 1 shows how diferent models performed when they were tested on
various entity types such as  ,     ,    ,    ,    , and   .</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>2.1.2. Relation Extraction</title>
          <p>Relation Extraction (RE) is a task in natural language processing that focuses on identifying and
extracting relationships between entities mentioned in text. In the context of the information
structuring phase of   , once named entities related to car damages have been recognized,</p>
          <p>Entities
the tool aims to establish relationships between these entities to gain a comprehensive
understanding of the reported damages. For instance, it aims to extract the relationship ℎ
between the car part and the damage. The RE task can be viewed as a classification task. The
goal is to classify and categorize the relationships between entities into diferent predefined
classes or categories.</p>
          <p>In this task, we evaluate the performance of multiple machine learning models for
recognizing and classifying relationships between entities. The models under consideration include
Support Vector Machines (SVM), K-Nearest Neighbors (KNN), Decision Trees (DT), and Random
Forests (RF). The objective is to determine the most efective model for relation extraction. Our
evaluation reveals that the RF model outperforms the others, providing better results in this
context. This achievement was realized through the optimization of particular hyperparameters,
specifically by setting the  _  to 8 and the  _ℎ to 10. Table 2 displays a
comparative analysis of various models for relation extraction covering relationships such as
ℎ , ℎ    ,    , and ℎ   .</p>
        </sec>
        <sec id="sec-3-1-3">
          <title>2.1.3. Discussion</title>
          <p>In structuring the information phase,   transforms the unstructured textual data into a
structured format (Figure 1) that can be readily utilized for further analysis. This phase enables
the accurate predictions and ensuring the reliability of the subsequent price estimation.</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Price Prediction</title>
        <p>In the price prediction phase, machine learning algorithms and statistical techniques are
employed to estimate the repair cost. These models utilize the structured data obtained from the</p>
        <p>Information structuring to predict the price of repair cost. The price prediction models are
trained using historical data, which encompasses structured data with actual price values. By
analyzing the relationships between the input features and the prices in the training data, the
models learn to make predictions on new, unseen data. In our study, we conducted a comparison
of several regression models to predict repair costs. The performance of these models was
evaluated using diferent evaluation metrics, including mean absolute error, mean squared error,
root mean squared error, and R-squared score. Among the evaluated models,    
model demonstrated the best performance, achieving an mean absolute error of 0.92 with the
following hyperparameters: n_estimators=100, learning_rate=0.1, max_depth=5. This
indicates that, on average, the predicted repair costs deviate from the actual costs by only 0.92
euros, Figure 2 present an example of estimating repair costs with     model.</p>
        <p>In Figure 1 and Figure 2, we present the interface of our   system, illustrating the
lfow from structured information extraction to price prediction. These figures provide a visual
representation of the diferent stages involved in our approach.
We conducted all our experiments using a real dataset of damage reports, and we ran them
on a machine equipped with 16 GB RAM and an Intel Core i7 − 12700 processor, ensuring
ample computational resources for both training and testing our models. The   tool was
developed using Python programming language and the   2 framework. The demo of
CarDRP is available online3.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Conclusion and Perspectives</title>
      <p>In this study, we propose a tool for predicting repair costs using unstructured data, which
operates in two phases. The first phase, information structuring transform unstructured textual
data into a structured format to facilitates accurate predictions and enhances the reliability
of subsequent price estimations. Furthermore, the price prediction phase employs machine
learning specially regression models to forecast the repair costs. Looking forward, there are
several perspectives to consider for future research. Firstly, it would be beneficial to explore the
incorporation of additional data to train deep learning models and further improve prediction
accuracy. Additionally, investigating the integration of semantic ontologies can provide a deeper
understanding of the underlying concepts and relationships within the data. This integration can
enhance the overall predictive capabilities of the system and enable more accurate estimations.
2https://streamlit.io/
3https://drive.google.com/drive/folders/1o0NOBqxj3rxFURFBmuH-C6kjj_d85TOU</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P. M.</given-names>
            <surname>Kyu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Woraratpanya</surname>
          </string-name>
          ,
          <article-title>Car damage detection and classification</article-title>
          ,
          <source>in: Proceedings of the 11th international conference on advances in information technology</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ahaggach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Abrouk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Foufou</surname>
          </string-name>
          , E. Lebon,
          <article-title>Predicting car sale time with data analytics and machine learning</article-title>
          ,
          <source>in: IFIP International Conference on Product Lifecycle Management</source>
          , Springer,
          <year>2022</year>
          , pp.
          <fpage>399</fpage>
          -
          <lpage>409</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ahaggach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Abrouk</surname>
          </string-name>
          , E. Lebon,
          <article-title>Information extraction and ontology population using car insurance reports</article-title>
          ,
          <source>in: International Conference on Information Technology-New Generations</source>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>405</fpage>
          -
          <lpage>411</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Laferty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>McCallum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. C.</given-names>
            <surname>Pereira</surname>
          </string-name>
          ,
          <article-title>Conditional random fields: Probabilistic models for segmenting and labeling sequence data (</article-title>
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Bidirectional lstm-crf models for sequence tagging</article-title>
          ,
          <source>arXiv preprint arXiv:1508</source>
          .
          <year>01991</year>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Vial</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Frej</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Segonne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Coavoux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lecouteux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Allauzen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Crabbé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Besacier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schwab</surname>
          </string-name>
          ,
          <article-title>Flaubert: Unsupervised language model pre-training for french</article-title>
          , arXiv preprint arXiv:
          <year>1912</year>
          .
          <volume>05372</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>