{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/bike-flow-prediction-with-multi-graph","title":"Bike Flow Prediction with Multi-Graph Convolutional Networks","arxiv_id":"1807.10934","date":"2018-07-28","proceeding":null,"authors":["Di Chai","Leye Wang","Qiang Yang"],"abstract":"One fundamental issue in managing bike sharing systems is the bike flow\nprediction. Due to the hardness of predicting the flow for a single station,\nrecent research works often predict the bike flow at cluster-level. While such\nstudies gain satisfactory prediction accuracy, they cannot directly guide some\nfine-grained bike sharing system management issues at station-level. In this\npaper, we revisit the problem of the station-level bike flow prediction, aiming\nto boost the prediction accuracy leveraging the breakthroughs of deep learning\ntechniques. We propose a new multi-graph convolutional neural network model to\npredict the bike flow at station-level, where the key novelty is viewing the\nbike sharing system from the graph perspective. More specifically, we construct\nmultiple inter-station graphs for a bike sharing system. In each graph, nodes\nare stations, and edges are a certain type of relations between stations. Then,\nmultiple graphs are constructed to reflect heterogeneous relationships (e.g.,\ndistance, ride record correlation). Afterward, we fuse the multiple graphs and\nthen apply the convolutional layers on the fused graph to predict station-level\nfuture bike flow. In addition to the estimated bike flow value, our model also\ngives the prediction confidence interval so as to help the bike sharing system\nmanagers make decisions. Using New York City and Chicago bike sharing data for\nexperiments, our model can outperform state-of-the-art station-level prediction\nmodels by reducing 25.1% and 17.0% of prediction error in New York City and\nChicago, respectively.","url_abs":"http://arxiv.org/abs/1807.10934v1","url_pdf":"http://arxiv.org/pdf/1807.10934v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"bike-flow-prediction-with-multi-graph","repo_url":"https://github.com/Di-Chai/GraphCNN-Bike","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"management","task_name":"Management"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.10934","atlas_url":"https://app.syntology.ai/?focus=1807.10934","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1807.10934"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.10934\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.10934"},"call":"get_concepts_for_paper(arxiv_id=\"1807.10934\")"}],"by_repo":[{"repo":"Di-Chai/GraphCNN-Bike","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"add06fa3ddef60bf7be77e11c93e138cbe577399bae7ada659dbe04d5aae4c39","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}