数据挖掘驱动代理预测在线拍卖最终价格

Preetinder Kaur, M. Goyal, Jie Lu
{"title":"数据挖掘驱动代理预测在线拍卖最终价格","authors":"Preetinder Kaur, M. Goyal, Jie Lu","doi":"10.1109/CIDM.2011.5949427","DOIUrl":null,"url":null,"abstract":"Auctions can be characterized by distinct nature of their feature space. This feature space may include opening price, closing price, average bid rate, bid history, seller and buyer reputation, number of bids and many more. In this paper, a clustering based method is used to forecast the end-price of an online auction for autonomous agent based system. In the proposed model, the input auction space is partitioned into groups of similar auctions by k-means clustering algorithm. The recurrent problem of finding the value of k in k-means algorithm is solved by employing elbow method using one way analysis of variance (ANOVA). Then k numbers of regression models are employed to estimate the forecasted price of an online auction. Based on the transformed data after clustering and the characteristics of the current auction, bid selector nominates the regression model for the current auction whose price is to be forecasted. Our results show the improvements in the end price prediction for each cluster which support in favor of the proposed clustering based model for the bid prediction in the online auction environment.","PeriodicalId":211565,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Data mining driven agents for predicting online auction's end price\",\"authors\":\"Preetinder Kaur, M. Goyal, Jie Lu\",\"doi\":\"10.1109/CIDM.2011.5949427\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Auctions can be characterized by distinct nature of their feature space. This feature space may include opening price, closing price, average bid rate, bid history, seller and buyer reputation, number of bids and many more. In this paper, a clustering based method is used to forecast the end-price of an online auction for autonomous agent based system. In the proposed model, the input auction space is partitioned into groups of similar auctions by k-means clustering algorithm. The recurrent problem of finding the value of k in k-means algorithm is solved by employing elbow method using one way analysis of variance (ANOVA). Then k numbers of regression models are employed to estimate the forecasted price of an online auction. Based on the transformed data after clustering and the characteristics of the current auction, bid selector nominates the regression model for the current auction whose price is to be forecasted. Our results show the improvements in the end price prediction for each cluster which support in favor of the proposed clustering based model for the bid prediction in the online auction environment.\",\"PeriodicalId\":211565,\"journal\":{\"name\":\"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIDM.2011.5949427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIDM.2011.5949427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

拍卖可以由其特征空间的不同性质来表征。这个特征空间可能包括开盘价、收盘价、平均投标率、投标历史、卖方和买方声誉、投标数量等等。本文采用基于聚类的方法对基于自主代理的在线拍卖系统的最终价格进行预测。在该模型中,通过k-means聚类算法将输入拍卖空间划分为相似的拍卖组。采用单向方差分析(ANOVA)的肘部法解决了k-means算法中反复出现的求k值问题。然后使用k个回归模型来估计在线拍卖的预测价格。根据聚类后的变换数据和当前拍卖的特征,竞价选择器为待预测价格的当前拍卖指定回归模型。我们的结果表明,每个聚类的最终价格预测都有所改进,这支持了基于聚类的在线拍卖环境下的出价预测模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data mining driven agents for predicting online auction's end price
Auctions can be characterized by distinct nature of their feature space. This feature space may include opening price, closing price, average bid rate, bid history, seller and buyer reputation, number of bids and many more. In this paper, a clustering based method is used to forecast the end-price of an online auction for autonomous agent based system. In the proposed model, the input auction space is partitioned into groups of similar auctions by k-means clustering algorithm. The recurrent problem of finding the value of k in k-means algorithm is solved by employing elbow method using one way analysis of variance (ANOVA). Then k numbers of regression models are employed to estimate the forecasted price of an online auction. Based on the transformed data after clustering and the characteristics of the current auction, bid selector nominates the regression model for the current auction whose price is to be forecasted. Our results show the improvements in the end price prediction for each cluster which support in favor of the proposed clustering based model for the bid prediction in the online auction environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信