Rank of Hangzhou Public Free-Bicycle System rent stations by improved k-means clustering

Yinglong Ge, Liming Tu, Haitao Xu
{"title":"Rank of Hangzhou Public Free-Bicycle System rent stations by improved k-means clustering","authors":"Yinglong Ge, Liming Tu, Haitao Xu","doi":"10.1109/ICMLC.2011.6017021","DOIUrl":null,"url":null,"abstract":"In China, Hangzhou is the first city to set up the Public Free-Bicycle System. There are many and many technology problems in the decision of intelligent dispatch. In this paper, we investigate the rank of Hangzhou Public Free-Bicycle System rent station with improved k-means clustering. Actually, ranking rent station is a very challenge work. In this paper, an improved k-means clustering algorithm is proposed for efficient getting the rank of Hangzhou Public Free-Bicycle System rent s-tations. At first, by passing over the cruel one week's database, a rent-return database is initialed. Then, the rank is determined from the borrow-return database.","PeriodicalId":228516,"journal":{"name":"2011 International Conference on Machine Learning and Cybernetics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Machine Learning and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2011.6017021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In China, Hangzhou is the first city to set up the Public Free-Bicycle System. There are many and many technology problems in the decision of intelligent dispatch. In this paper, we investigate the rank of Hangzhou Public Free-Bicycle System rent station with improved k-means clustering. Actually, ranking rent station is a very challenge work. In this paper, an improved k-means clustering algorithm is proposed for efficient getting the rank of Hangzhou Public Free-Bicycle System rent s-tations. At first, by passing over the cruel one week's database, a rent-return database is initialed. Then, the rank is determined from the borrow-return database.
基于改进k均值聚类的杭州公共免费自行车系统租赁站排名
在中国,杭州是第一个建立公共免费自行车系统的城市。智能调度决策中存在着许多技术问题。本文采用改进的k-means聚类方法对杭州市公共免费自行车系统租赁站的排名进行了研究。实际上,对出租站进行排名是一项非常具有挑战性的工作。本文提出了一种改进的k-means聚类算法,用于有效地获取杭州市公共免费自行车系统的租赁位置排名。首先,通过传递残酷的一周数据库,初始化了一个租金回报数据库。然后,从借-还数据库中确定等级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信