<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The Analysis of Tra jectories in Moscow Subway</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mariia Nekraplonna</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dmitry Namiot</string-name>
          <email>dnamiot@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Lomonosov Moscow State University</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>134</fpage>
      <lpage>146</lpage>
      <abstract>
        <p>Along with the continuous growth of megacities, their transportation systems have become increasingly large and complex. The use of transportation systems by passengers directly reflects the changes that occur in the urban environment - for this reason, the study of urban mobility is an important task of digital urbanism. In particular, this paper is devoted to the study of spatial patterns (repetitive routes) in transportation systems with the case study on the Moscow subway. A brief review of data mining approaches to transportation systems data in general and to the task of spatial patterns extraction, in particular, is presented. A simple method for pattern extraction is proposed and applied to the Moscow subway data. As a result of the deployment of the proposed method the list of patterns was obtained - the graph of spatial patterns of the transport system under study was constructed based on it.</p>
      </abstract>
      <kwd-group>
        <kwd>Urban mobility</kwd>
        <kwd>Digital urbanism</kwd>
        <kwd>Travel behaviour</kwd>
        <kwd>Ridership patterns</kwd>
        <kwd>Public transport</kwd>
        <kwd>Data mining</kwd>
        <kwd>Time series</kwd>
        <kwd>Clustering analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The present paper is a continuation of a series of works devoted to the analysis of
urban displacements [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1-4</xref>
        ]. Common to all the problems is that the basic elements
for the analysis are the so-called origin-destination matrices (OD-matrices). Such
matrices represent information about the number of movements between two
points (objects) during a certain time interval. Objects can be city railroad
stations, subway stations, or even geographically delineated areas. In this study,
we deal with correspondence matrices for rail transport. In this case, as is clear,
the routes between the two stations are pre-defined. In the case of correspondence
matrices for geo-areas, the task of choosing a route appears additionally.
      </p>
      <p>Such matrices allow to fully describe trafic flows in the city. In many cases,
it is the construction (prediction) of such matrices that is the ultimate goal of
transport systems analysis. The development of telecommunications technology
(discussed in more detail in Section 2) has led to the fact that such data can be
collected (measured) with the help of telecommunications operators. This means
that these kinds of data, instead of predictive (computable) data, have become
raw data. The task of forecasting has become irrelevant. It is pointless to predict
what will be accurately measured.</p>
      <p>In the above representation, the correspondence matrix is a closed system.
If we consider the correspondence matrix for the Moscow metro, then there
is no information about, for example, that a new route from the suburbs has
opened, which will increase the number of system users (passengers). There is no
information in the system about any cultural events that for some time increase
the total number of passengers, and so on.</p>
      <p>The metro responds to some new passenger flows (they are reflected in the
matrix), but there is no information about these new flows in the system. Specific
example. Switching suburban buses from the bus station near the Tushinskaya
metro station to the new bus station near the Khovrino metro station will cause
(caused) a certain peak in the load in the morning on the green metro line, but
this could only be registered after the fact. It was impossible to predict this
in any way, since the bus route information is external to the correspondence
matrix.</p>
      <p>From this follows another important statement. The correspondence matrix
obtained by the method described above is a certain measuring tool, which can be
used to determine the occurrence of some events in the city or to check the results
of any action. Changes in passenger behavior (changes in routes, travel times)
are something that can theoretically be determined and each such change must,
naturally, be somehow explained in terms of changes in the city. The efect of any
mass events will also be reflected in transport movements (participants need to
arrive and leave, which should correspond to the deviation in the correspondence
matrix compared to the "normal" values).</p>
      <p>
        We deliberately avoid using the term transport tasks, because the analysis,
although related to the transport systems (processes), but its main purpose was
digital urbanism [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In general, the analysis was used to describe the functioning
of the city as a system. Movement patterns are needed, for example, not only to
identify stressful places in the transport system, but also to assess the real points
of attraction in the city - where jobs are concentrated, where residents go on
weekends for recreation, etc. Knowledge (understanding) of the usual structure
of passenger trafic makes it possible to identify abnormal behavior (peaks or
dips in trafic, changes in "normal" routes). In some cases, such anomalies are
easily predictable and understandable. For example, the end of a large concert
(soccer match) will cause a peak in the entrance at the nearest metro stations.
In this case, the definition of anomalies will only give a numerical estimation of
these peaks. In other cases, the reasons for such anomalies may not be obvious
at all, and here their determination will serve as just a signal for the city services
that it is necessary to look for the cause of this phenomenon. In other words,
the result of the analysis for trafic data will always end up being some metric
for the urban system.
      </p>
      <p>In principle, two approaches to analyzing this kind of data are possible. First,
we can consider the change of the system in the time domain. How the
inputs/outputs for stations change over time (see Fig. 1). For a correspondence
matrix, we summarize the data by rows (inputs to a station) or columns (outputs
from a station) and analyze the change in this data over time.</p>
      <p>In fact, it is an analysis of how subway stations are used during the day,
weekdays, and weekends. The familiar notion of "rush hour" is exactly about
this type of analysis.</p>
      <p>Another possibility is that we are investigating trajectories (spatial or
spatiotemporal slice) - Fig. 2. Where do passengers go most often from station A?
Are there any recurring patterns here? How are the preferred destination
stations (if any) distributed by time on weekdays and weekends? If in the temporal
analysis the main question was "when do passengers travel from/to the station",
in the spatial analysis it is "where do passengers travel from/to the station".</p>
      <p>
        The very idea of studying exactly spatial characteristics (trips, routes) came
from the analysis of movements using suburban railroads [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and works on
determining anomalies in trafic [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. For suburban railroads, there was a clear pattern
of selecting the route’s end station as the first station where there is an
intersection with the subway line(s). And this pattern changed on weekends. As a
matter of fact, the new trafic scheme on the suburban diametrical routes should
have changed this pattern and suggested that passengers continue to use the
railroad in the city, rather than transfer to the subway at the first opportunity.
      </p>
      <p>Also, the spatial analysis leads to an estimate of the duration of movements
(the duration of routes), and this, as we know, is one of the main characteristics
of transport behavior. Another consideration is that the endpoints of the routes
should correspond to what are commonly called points of attraction. At the same
time, such points of attraction will obviously depend on time and, perhaps, on
days of the week. For example, the stations where most of the trips (routes)
end in the morning are what corresponded to the working districts in the time
section of the research, etc.</p>
      <p>
        The first studies in terms of determining routes showed [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], for example, that
in the north of Moscow on weekdays most of the passengers from Rechnoi Vokzal
station go to Voykovskaya station (most experts were sure that passengers go at
least to the nearest interchange) - Fig. 3. And this route remains the most
popular all weekdays. At the same time, on weekends (also steadily during the month)
the most popular route is to the city center. Accordingly, this division determines
working points of attraction and places of rest for the northern direction.
      </p>
      <p>Accordingly, in this article, we would like to test the hypothesis of whether
there are stable (repeating) routes in the city’s transport system or not. If such
routes are not connected with the stations through which the shortest routes
pass, then the analysis of trajectories (movements) will allow to highlight the
transport preferences of passengers, which will reflect some existing division in
the city.</p>
      <p>
        Note that for the metro (as well as for other rail transport), the travel time
between two stations is fixed with suficient accuracy. Accordingly, a trip (aka a
trajectory) can be measured in units of time. This is an important characteristic
specifically for urban planning and management - the time passengers spend on
the road. For example, the Figure 4 shows the distribution of travel times for two
cities in the United States (Boston and San-Francisco) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. This is an integral
indicator for urban transport.
      </p>
      <p>The rest of the article is structured as follows. Section 2 describes the
presentation of the data. Section 3 deals with general issues of analyzing this kind
of data. In particular, the results of data analysis in the temporal domain are
presented here for comparison. Section 4 is devoted to a brief analysis of works
on the study of trajectories of movement in the city. Section 5 is a presentation of
the first results on the study of the routes of passengers in the Moscow subway.
Section 6 presents the conclusion.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Data and Data Representation</title>
      <p>The Moscow Metro belongs to those few systems where smart cards are used
only for entry (tap-in event) and payment is made at a single (’flat’) tarif. This
means that it is impossible to accurately track the passenger flow by ticket
identification numbers, as in usual transport systems with double ticket attachments
(tap-in and tap-out). Only some heuristic assumptions can be made that gaps
in travel document usage determine the route. Fortunately, the Moscow Metro
also has another important feature: mobile communication here is provided both
above and below ground. Thus, an alternative way to measure passenger flows
is to record the activity of their smartphones. In this case, switching from an
above-ground communication tower to an underground one is equal to a tap-in
event, and switching back to a tap-out event. Thus, we have an opportunity to
build time series of inflow and outflow of passengers the same as in other
researches using smart-card data. Obtained data are impersonal aggregate records
of passenger movements with half an hour intervals for February 2018. We can
neither trace the trajectory of a specific passenger nor link it to a specific phone
number. The data have been previously cleared: trips longer than 4 hours have
been cleared, as well as those with the start station coinciding with the arrival
station. The data are provided in CSV format and contain in total about 226
044 records (207 stations during 28 days, 39 time-intervals per day). Each of the
records contains two values: the number of passengers who started their trip on
a certain route in the period of time and the number of passengers who finished
this route. In fact, this table is a form of a record of origin-destination matrix.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Analysis of Transport Systems Data</title>
      <p>
        The first automatic fare collection systems in public transport were introduced
more than 50 years ago. During this time, quite a lot of data has been
accumulated on passenger transport behavior, which is now analyzed by various
scientists from diferent points of view. First and foremost, of course, is the
prediction of the value of passenger trafic. This task has been considered in many
works, among others [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Note that changing the data collection scheme should also change the
approach to transport problems. For example, in a work typical of the traditional
approach [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], the authors try to predict the daily trafic of the entire
transport network from historical data. First, the total trafic without division by
stations / lines can only be useful for calculating revenue. Secondly, the article
discusses the forecast, while changing the data collection scheme gives accurately
measured trafic for individual stations with a step of 5 minutes. Why predict
what is being measured exactly? The change in the data collection scheme also
changed the transport tasks. They used to traditionally deal with forecasts. If
trafic is accurately measured, then predictions become meaningless. Trafic is
now another form of measurement in the city. This is what is being promoted
in our article. And measurements, of course, should be more substantive. The
measurement level should be shallower - a station, instead of the entire transport
network. Nevertheless, apart from forecasting, an important direction is a subset
of advanced knowledge extraction tasks.
      </p>
      <p>
        We can distinguish three main directions in the analysis of trafic flows in
relation to rail transport: the passenger-oriented [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ], the event-oriented [
        <xref ref-type="bibr" rid="ref11 ref12">11,
12</xref>
        ], and the station-oriented. The first one is aimed to identify groups of
passengers with similar travel behavior. The peculiarity of this approach is the
applicability only to the transport system of the tap-in-tap-out category. The
second approach, event-based, clusters days (or other time intervals) depending
on the similarity of the whole public transport system operating mode. For this
approach, it is important that the observation period be large enough to cover
all the events of interest to the researchers - for example, as many periods with
diferent weather in the study [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Finally, the last approach, which was the
objective of previous research [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], clusters stations on the basis of when their
activity occurs, i.e. how trips made at the stations are distributed over time. It
is important to note that this approach can be implemented both from a time
perspective and from a spatial perspective.
      </p>
      <p>
        The station-oriented researches with time perspective the key question is
"when do passengers depart/arrive from stations?". In this case, the subject
of the study is a set of diferent characteristics of the time series describing the
passenger flow, such as peaks of passenger activity. As an example, see [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], where
several clusters were identified by the time series clustering. For the Moscow
subway, we have already solved such a problem in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], the results are shown in
Fig. 5.
      </p>
      <p>In station-oriented studies with a spatial perspective, the subject is not the
temporal characteristics of passenger trafic, but the spatial ones. In other words,
the researcher asks the question "where are the existing passenger flows directed?
We can talk about patterns if we see repeating routes in this study. Since such
studies have not yet been conducted for the Moscow Metro, we believe it is
necessary to fill in the existing gap.</p>
      <p>
        Note also that we can talk about a certain combination of approaches: "where
do they go at such and such periods of time." These will be time travel patterns.
Speaking about similar works, one can cite, for example, article [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. This article
develops a comprehensive methodology for the study of prevailing trajectories
in urban studies. Researchers are now using cluster analysis tools to identify
diferent typologies of areas and principal component analysis (PCA) to
determine socio-economic interactions. The work uses sequential dynamic analysis to
identify trajectories.
      </p>
      <p>
        With regard to the analysis of trajectories, one can also note the paper [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
It uses the fact that the trajectories in the subway can be compared in time.
Here the authors split all routes into several intervals of 20 minutes and study
the distribution of routes in time.
      </p>
      <p>
        Several works performed at Moscow State University [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ] directly
investigated the nature of the movement of passengers on suburban railways. For
example, work [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] noted an asymmetry in suburban trafic on weekends - the
number of people leaving by rail to Moscow was always greater than the number
of those returning by rail. The same asymmetry was confirmed in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Figure 6
shows a visualization using Kepler.gl [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] of real trips.
5
      </p>
    </sec>
    <sec id="sec-4">
      <title>Analysis of Moscow Subway Trajectories</title>
      <p>In this paper, the most popular paths were considered. Denote the number of
trips from station i to station j in day n as tripsin,j . For station i we will call the
most popular direction in day n station j such that the value of tripsin,j is the
largest. Next, k-th most popular direction of station i will be station j, which
will be at k-th place if we order all stations in descending order according to</p>
      <p>Fig. 6. Moscow - Tver railroad trips.
how many times they became the most popular direction for the day during the
entire observation period. In Fig. 7, you can see what proportion of the 1st, 2nd,
and 3rd most recurring destinations are from all of the most popular destinations
for each of the metro stations for the day.</p>
      <p>As you can see, for almost all stations, the 1st most recurring direction has
persisted (red color) for more than half of the observation period. This suggests
that the 1st most repeatable direction is indeed a spatial pattern, the deviation
from which, generally speaking, should be considered more carefully. Having
distinguished the spatial patterns as described above, we can construct a graph
of spatial patterns of the Moscow Metro: each station has one vertex and each
pattern has one directional edge (Fig. 8). An interesting observation was the
existence of a large center of attraction in this graph: for some reason 82 out
of 207 patterns are directed towards one station - it is Chekhovskaya station of
Serpukhovsko-Timiryazevskaya subway line.</p>
      <p>In this figure, Chekhovskaya station is circled in red. The landing of routes
at this station can, in principle, be explained by its centrality in the transport
graph (static characteristic of the graph, reflecting the number of the shortest
routes passing through the node). Examples of other stations highlighted in
green, where at least 5 routes end, are already a reflection of the characteristics
of the city. From some stations, passengers go to some predefined places.</p>
      <p>It should be noted, however, that the popular routes for the stations remained
this way throughout the day. This answers the question of combining temporal
and spatial analysis. At least in this study, we did not find any changes in routes
over time. Routes changed only between weekdays and weekends. Technically,
this should mean that the patterns found fit well with the points of attraction
of the city - where passengers travel on weekdays, and where - on weekends.</p>
      <p>Explaining such routes is already the task of urbanists. For example, one
of the route hypotheses in Figure 2 is that passengers arriving from the north
of Moscow do not want to spend a lot of time commuting to work. And the
station of attraction (the end of the routes) Voikovskaya - there is the first
station where there is a suficient number of ofices and business centers (jobs).
The stations before her belong more to the rescue areas. But this, of course,
is only a hypothesis. What is important here is that trajectory analysis allows
you to identify such areas in the city, that is, it is some kind of urban metric.
Accordingly, the change in routes will serve as an indicator of some changes in
the city (opening and settling of ofice centers, settling in housing estates, etc.).
6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>This paper is devoted to the study of spatial patterns (repetitive routes) in
transportation systems with the case study on the Moscow subway. A brief review
of data mining approaches to transportation systems data in general and to the
task of spatial patterns extraction, in particular, is presented. A simple method
for pattern extraction is proposed and applied to the Moscow subway data. As
a result of the deployment of the proposed method, the list of patterns was
obtained, and the graph of spatial patterns of the transport system under study
was constructed based on it. The result is the first time confirmation (finding) of
stable routes in the metro transport system. And such routes are not associated
with the centrality of the transport system graph (that is, with stations through
which more shortest routes pass). The fact that the movements between the
designated stations remain constant during the work week and constant during
the weekend is precisely an indicator that these are some routes due to the
structure of the city. Understanding the routes of passengers on the Moscow
metro serves to determine their transport behavior. The latter is one of the
basic characteristics of the transport system in a Smart City.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Nekraplonna</surname>
          </string-name>
          , Mariia, and Dmitry Namiot:
          <article-title>Metro correspondence matrix analysis</article-title>
          .
          <source>International Journal of Open Information Technologies 7</source>
          .7 (
          <year>2019</year>
          ):
          <fpage>68</fpage>
          -
          <lpage>80</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Namiot</surname>
          </string-name>
          ,
          <string-name>
            <surname>Dmitry</surname>
          </string-name>
          , et al.:
          <article-title>Where and when-about one approach to trafic analysis in the city</article-title>
          .
          <source>International Journal of Open Information Technologies 9</source>
          .3 (
          <year>2021</year>
          ):
          <fpage>44</fpage>
          -
          <lpage>49</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Misharin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Namiot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Pokusaev</surname>
          </string-name>
          :
          <article-title>On Processing of Correspondence Matrices in Transport Systems</article-title>
          . In: 2019
          <source>International Multi-Conference on Industrial Engineering and Modern Technologies</source>
          , FarEastCon. IEEE (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Namiot</given-names>
            <surname>Dmitry</surname>
          </string-name>
          , and Oleg Pokusaev:
          <article-title>On mobility patterns in Smart City</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kitchin</surname>
          </string-name>
          ,
          <article-title>Rob: The real-time city? Big data and smart urbanism</article-title>
          .
          <source>GeoJournal 79</source>
          .1 (
          <year>2014</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bulygin</surname>
          </string-name>
          , Mark, and Dmitry Namiot:
          <article-title>Anomaly Detection Method For Aggregated Cellular Operator Data</article-title>
          .
          <source>In: 2021 28th Conference of Open Innovations Association (FRUCT)</source>
          .
          <source>IEEE</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. Zhang, Kai, et al.
          <article-title>A framework for passengers demand prediction and recommendation</article-title>
          .
          <source>2016 IEEE International Conference on Services Computing (SCC)</source>
          . IEEE,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Wang</surname>
            <given-names>J.</given-names>
          </string-name>
          et al.
          <article-title>Vulnerability analysis and passenger source prediction in urban rail transit networks //PloS one</article-title>
          . -
          <source>2013. - Т. 8</source>
          . -
          <fpage>№</fpage>
          . 11. -
          <fpage>С</fpage>
          .
          <year>e80178</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>El</given-names>
            <surname>Mahrsi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.K.</given-names>
            , C^ome, E.,
            <surname>Oukhellou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Verleysen</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Clustering smart card data for urban mobility analysis</article-title>
          .
          <source>IEEE Transactions on intelligent transportation systems 18(3)</source>
          ,
          <fpage>712</fpage>
          -
          <lpage>728</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Goulet-Langlois</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haris</surname>
            ,
            <given-names>N.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jinhua</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Inferring patterns in the multi-week activity sequences of public transport users</article-title>
          . Transportation research part C: emerging technologies,
          <volume>64</volume>
          (
          <issue>3</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>F.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.D.</given-names>
          </string-name>
          :
          <article-title>Clustering daily metro origin-destination matrix in Shenzhen, China</article-title>
          .
          <source>Applied mechanics and materials 743</source>
          ,
          <fpage>422</fpage>
          -
          <lpage>432</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Daily metro origin-destination pattern recognition using dimensionality reduction and clustering methods</article-title>
          .
          <source>Intelligent transportation systems 2017 IEEE 20th International Conference</source>
          ,
          <volume>548</volume>
          -
          <fpage>553</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
          </string-name>
          , P.-Y.,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ji</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qian</surname>
          </string-name>
          , W.-W.:
          <article-title>Clustering analysis of ridership patterns at subway stations: a case in Nanjing, China</article-title>
          .
          <source>Journal of urban planning and development</source>
          ,
          <volume>145</volume>
          (
          <issue>2</issue>
          ) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Li</surname>
            , Yuchen, and
            <given-names>Yichun</given-names>
          </string-name>
          <string-name>
            <surname>Xie</surname>
          </string-name>
          .
          <article-title>A new urban typology model adapting data mining analytics to examine dominant trajectories of neighborhood change: a case of metro Detroit</article-title>
          .
          <source>Annals of the American Association of Geographers 108.5</source>
          (
          <year>2018</year>
          ):
          <fpage>1313</fpage>
          -
          <lpage>1337</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ping</surname>
          </string-name>
          , et al.
          <article-title>Cluster and characteristic analysis of Shanghai metro stations based on metro card and land-use data</article-title>
          .
          <source>Geo-spatial Information Science 23.4</source>
          (
          <year>2020</year>
          ):
          <fpage>352</fpage>
          -
          <lpage>361</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Misharin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Namiot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Pokusaev</surname>
          </string-name>
          .
          <article-title>On Passenger Flow Estimation for new Urban Railways</article-title>
          . IOP Conference Series: Earth and
          <string-name>
            <given-names>Environmental</given-names>
            <surname>Science</surname>
          </string-name>
          . Vol.
          <volume>177</volume>
          . No.
          <article-title>1</article-title>
          .
          <string-name>
            <given-names>IOP</given-names>
            <surname>Publishing</surname>
          </string-name>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Medvedenko</surname>
            , Stepan, and
            <given-names>Dmitry</given-names>
          </string-name>
          <string-name>
            <surname>Namiot</surname>
          </string-name>
          .
          <article-title>"Visual analysis of railway passenger trafic data."</article-title>
          <source>International Journal of Open Information Technologies 9</source>
          .6 (
          <year>2021</year>
          ):
          <fpage>51</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>He</surname>
          </string-name>
          , Shan. From Beautiful Maps to Actionable Insights:
          <article-title>Introducing Kepler. gl, Uber's Open Source Geospatial Toolbox</article-title>
          . Uber Engineering Blog (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Ivanov</surname>
            ,
            <given-names>V. V.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>and E. S.</given-names>
            <surname>Osetrov</surname>
          </string-name>
          .
          <article-title>Forecasting daily passenger trafic volumes in the Moscow metro</article-title>
          .
          <source>Physics of Particles and Nuclei Letters 15.1</source>
          (
          <year>2018</year>
          ):
          <fpage>107</fpage>
          -
          <lpage>120</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>