Vehicle Price Prediction By Aggregating decision tree model With
Boosting Model
- URL: http://arxiv.org/abs/2307.15982v1
- Date: Sat, 29 Jul 2023 13:07:57 GMT
- Title: Vehicle Price Prediction By Aggregating decision tree model With
Boosting Model
- Authors: Auwal Tijjani Amshi
- Abstract summary: This project uses python scripts to normalize, standardize, and clean data to avoid unnecessary noise for machine learning algorithms.
The proposed system uses a Decision tree model and Gradient boosting predictive model, which are combined in other to get closed to accurate prediction.
The future price prediction of used vehicles with the help of the same data set will comprise different models.
- Score: 0.0
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Predicting the price of used vehicles is a more interesting and needed
problem by many users. Vehicle price prediction can be a challenging task due
to the high number of attributes that should be considered for accurate
prediction. The major step in the prediction process is the collection and
pre-processing of the data. In this project, python scripts were built to
normalize, standardize, and clean data to avoid unnecessary noise for machine
learning algorithms. The data set used in this project can be very valuable in
conducting similar research using different prediction techniques. Many
assumptions were made on the basis of the data set. The proposed system uses a
Decision tree model and Gradient boosting predictive model, which are combined
in other to get closed to accurate prediction, the proposed model was evaluated
and it gives a promising performance. The future price prediction of used
vehicles with the help of the same data set will comprise different models.
Related papers
- Conformal online model aggregation [29.43493007296859]
This paper proposes a new approach towards conformal model aggregation in online settings.
It is based on combining the prediction sets from several algorithms by voting, where weights on the models are adapted over time based on past performance.
arXiv Detail & Related papers (2024-03-22T15:40:06Z) - ProbSAINT: Probabilistic Tabular Regression for Used Car Pricing [5.944878323024931]
We introduce ProbSAINT, a model that offers a principled approach for uncertainty of its price predictions.
We show how ProbSAINT can be used as a dynamic forecasting model for predicting price probabilities for different expected offer duration.
arXiv Detail & Related papers (2024-03-06T16:00:50Z) - Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model [16.466711636334587]
Online decision-makers often obtain predictions on future variables, such as arrivals, demands, and so on.
Prediction accuracy is unknown to decision-makers a priori, hence blindly following the predictions can be harmful.
We develop algorithms that utilize predictions in a manner that is robust to the unknown prediction accuracy.
arXiv Detail & Related papers (2024-02-21T04:57:32Z) - Predictive Churn with the Set of Good Models [64.05949860750235]
We study the effect of conflicting predictions over the set of near-optimal machine learning models.
We present theoretical results on the expected churn between models within the Rashomon set.
We show how our approach can be used to better anticipate, reduce, and avoid churn in consumer-facing applications.
arXiv Detail & Related papers (2024-02-12T16:15:25Z) - Rationalizing Predictions by Adversarial Information Calibration [65.19407304154177]
We train two models jointly: one is a typical neural model that solves the task at hand in an accurate but black-box manner, and the other is a selector-predictor model that additionally produces a rationale for its prediction.
We use an adversarial technique to calibrate the information extracted by the two models such that the difference between them is an indicator of the missed or over-selected features.
arXiv Detail & Related papers (2023-01-15T03:13:09Z) - Forecasting Sensor Values in Waste-To-Fuel Plants: a Case Study [0.47248250311484113]
We develop machine learning models to predict future sensor readings of a waste-to-fuel plant.
The models were trained using historical data and predictions were made based on sensor readings taken at a specific time.
We tested our models on a real-world use case at a waste-to-fuel plant in Canada.
arXiv Detail & Related papers (2022-09-28T09:40:58Z) - Datamodels: Predicting Predictions from Training Data [86.66720175866415]
We present a conceptual framework, datamodeling, for analyzing the behavior of a model class in terms of the training data.
We show that even simple linear datamodels can successfully predict model outputs.
arXiv Detail & Related papers (2022-02-01T18:15:24Z) - Backward-Compatible Prediction Updates: A Probabilistic Approach [12.049279991559091]
We formalize the Prediction Update Problem and present an efficient probabilistic approach as answer to the above questions.
In extensive experiments on standard classification benchmark data sets, we show that our method outperforms alternative strategies for backward-compatible prediction updates.
arXiv Detail & Related papers (2021-07-02T13:05:31Z) - Test-time Collective Prediction [73.74982509510961]
Multiple parties in machine learning want to jointly make predictions on future test points.
Agents wish to benefit from the collective expertise of the full set of agents, but may not be willing to release their data or model parameters.
We explore a decentralized mechanism to make collective predictions at test time, leveraging each agent's pre-trained model.
arXiv Detail & Related papers (2021-06-22T18:29:58Z) - AutoCP: Automated Pipelines for Accurate Prediction Intervals [84.16181066107984]
This paper proposes an AutoML framework called Automatic Machine Learning for Conformal Prediction (AutoCP)
Unlike the familiar AutoML frameworks that attempt to select the best prediction model, AutoCP constructs prediction intervals that achieve the user-specified target coverage rate.
We tested AutoCP on a variety of datasets and found that it significantly outperforms benchmark algorithms.
arXiv Detail & Related papers (2020-06-24T23:13:11Z) - Spatiotemporal Relationship Reasoning for Pedestrian Intent Prediction [57.56466850377598]
Reasoning over visual data is a desirable capability for robotics and vision-based applications.
In this paper, we present a framework on graph to uncover relationships in different objects in the scene for reasoning about pedestrian intent.
Pedestrian intent, defined as the future action of crossing or not-crossing the street, is a very crucial piece of information for autonomous vehicles.
arXiv Detail & Related papers (2020-02-20T18:50: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.