<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Chen_et_al_2016d</id>
		<title>Chen et al 2016d - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Chen_et_al_2016d"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Chen_et_al_2016d&amp;action=history"/>
		<updated>2026-05-08T11:45:17Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Chen_et_al_2016d&amp;diff=199645&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 590947446 to Chen et al 2016d</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Chen_et_al_2016d&amp;diff=199645&amp;oldid=prev"/>
				<updated>2021-02-01T23:53:56Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_590947446&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 590947446&quot;&gt;Draft Content 590947446&lt;/a&gt; to &lt;a href=&quot;/public/Chen_et_al_2016d&quot; title=&quot;Chen et al 2016d&quot;&gt;Chen et al 2016d&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 23:53, 1 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Chen_et_al_2016d&amp;diff=199644&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; Bike sharing is booming globally as a green transportation mode, but the occurrence of over-demand stations that have no bikes or dock...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Chen_et_al_2016d&amp;diff=199644&amp;oldid=prev"/>
				<updated>2021-02-01T23:53:50Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; Bike sharing is booming globally as a green transportation mode, but the occurrence of over-demand stations that have no bikes or dock...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
International audience; Bike sharing is booming globally as a green transportation mode, but the occurrence of over-demand stations that have no bikes or docks available greatly affects user experiences. Directly predicting individual over-demand stations to carry out preventive measures is difficult, since the bike usage pattern of a station is highly dynamic and context dependent. In addition, the fact that bike usage pattern is affected not only by common contextual factors (e.g., time and weather) but also by opportunistic contextual factors (e.g., social and traffic events) poses a great challenge. To address these issues, we propose a dynamic cluster-based framework for over-demand prediction. Depending on the context, we construct a weighted correlation network to model the relationship among bike stations, and dynamically group neighboring stations with similar bike usage patterns into clusters. We then adopt Monte Carlo simulation to predict the over-demand probability of each cluster. Evaluation results using real-world data from New York City and Washington, D.C. show that our framework accurately predicts over-demand clusters and outperforms the baseline methods significantly&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1145/2971648.2971652 http://dx.doi.org/10.1145/2971648.2971652]&lt;br /&gt;
&lt;br /&gt;
* [https://hal.archives-ouvertes.fr/hal-01404490 https://hal.archives-ouvertes.fr/hal-01404490]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/huc/ubicomp2016.html#ChenZWYMLWPNJ16 https://dblp.uni-trier.de/db/conf/huc/ubicomp2016.html#ChenZWYMLWPNJ16],&lt;br /&gt;
: [https://dl.acm.org/citation.cfm?id=2971652 https://dl.acm.org/citation.cfm?id=2971652],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01404490 https://hal.archives-ouvertes.fr/hal-01404490],&lt;br /&gt;
: [https://dl.acm.org/ft_gateway.cfm?id=2971652&amp;amp;ftid=1786363&amp;amp;dwn=1 https://dl.acm.org/ft_gateway.cfm?id=2971652&amp;amp;ftid=1786363&amp;amp;dwn=1],&lt;br /&gt;
: [https://doi.org/10.1145/2971648.2971652 https://doi.org/10.1145/2971648.2971652],&lt;br /&gt;
: [https://doi.acm.org/10.1145/2971648.2971652 https://doi.acm.org/10.1145/2971648.2971652],&lt;br /&gt;
: [https://repository.ust.hk/ir/Record/1783.1-81203 https://repository.ust.hk/ir/Record/1783.1-81203],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2515292392 https://academic.microsoft.com/#/detail/2515292392]&lt;br /&gt;
&lt;br /&gt;
* [http://dl.acm.org/ft_gateway.cfm?id=2971652&amp;amp;amp;ftid=1786363&amp;amp;amp;dwn=1 http://dl.acm.org/ft_gateway.cfm?id=2971652&amp;amp;amp;ftid=1786363&amp;amp;amp;dwn=1],&lt;br /&gt;
: [http://dx.doi.org/10.1145/2971648.2971652 http://dx.doi.org/10.1145/2971648.2971652] under the license http://www.acm.org/publications/policies/copyright_policy#Background&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>