Package for modelling clickstream data using Markov chains
Python implementation of the R package clickstream which models website clickstreams as Markov chains.
markovclick allows you to model clickstream data from websites as Markov chains, which can then be used to predict the next likely click on a website for a user, given their history and current state.
- Python 3.X
- seaborn (Recommended)
python setup.py install
pip install markovclick
Tests can be run using the
pytest command from the root directory.
Documentation can be viewed at https://markovclick.readthedocs.io/.
To build the documentation, run
make html inside the
To start using the package without any data,
markovclick can produce dummy data for you to experiment with:
from markovclick import dummy clickstream = dummy.gen_random_clickstream(n_of_streams=100, n_of_pages=12)
In the context of this package, streams refer to a series of clicks belonging to a given user. The time difference between clicks is defined by the user when assembling these streams, but is typically taken to be 30 minutes in the industry.
The pages refer to the individual clicks of the user, and thus the pages they visit. Rather than storing the entire URL of the page the user visits, it is better to encode pages using a simple code such as
X can be any number. This strategy can be used to group similar pages under the same code, as modelling them as separate pages is sometimes not useful leading to an excessively large probability matrix.
Building Markov chains
To build a Markov chain from the dummy data:
from markovclick.models import MarkovClickstream m = MarkovClickstream(clickstream)
m of the
MarkovClickstream class provides access the class's attributes such as the probability matrix (
m.prob_matrix) used to model the Markov chain, and the list of unique pages (
m.pages) featuring in the clickstream.
The PageRank score for each page in the clickstream can also be calculated as follows:
digraph, pagerank = m.calculate_pagerank(max_nodes=2)
|max_nodes||int||(Optional, defaults to 2). The number of pages to include as nodes linking to each node when generating the graph. Selected in order of most probable transition from Markov chain|
|pr_kwargs||dict||(Optional, defaults to
digraph object holds the
DiGraph class which was used to calculate the PageRank score, and the
pagerank object is a dictionary of PageRank scores for each page in the network.
Visualising as a heatmap
The probability matrix can be visualised as a heatmap as follows:
sns.heatmap(m.prob_matrix, xticklabels=m.pages, yticklabels=m.pages)
Visualising the Markov chain
A Markov chain can be thought of as a graph of nodes and edges, with the edges representing the transitions from each state.
markovclick provides a wrapper function around the
graphviz package to visualise the Markov chain in this manner.
from markovclick.viz import visualise_markov_chain graph = visualise_markov_chain(m)
visualise_markov_chain() returns a
Digraph object, which can be viewed directly inside a Jupyter notebook by simply calling the reference to the object returned. It can also be outputted to a PDF file by calling the
render() function on the object.
In the graph produced, the nodes representing the individual pages are shown in green, and up to 3 edges from each node are rendered. The first edge is in a thick blue arrow, depicting the most likely transition from this page / state to the next page / state. The second edge depicted by a thinner blue arrow, depicts the second most likely transition from this state. Finally, a third edge is shown that depicts the transition from this page / state back to itself (light grey). This edge is only shown if the the two most likely transitions are not already to itself. For all transitions, the probability is shown next to the edge (arrow).
Clickstream processing with
markovclick provides functions to process clickstream data such as server logs, which contain unique identifiers such as cookie IDs associated with each click. This allows clicks to be aggregated into groups, whereby clicks from the same browser (identified by the unique identifier) are grouped such that the difference between individual clicks does not exceed the maximum session timeout (typically taken to be 30 minutes).
Sessionise clickstream data
To sessionise clickstream data, the following code can be used that require a
pandas DataFrame object.
from markovclic.preprocessing import Sessionise sessioniser = Sessionise(df, unique_id_col='cookie_id', datetime_col='timestamp', session_timeout=30)
||String||Column name of unique identifier, e.g.
||String||Column name of timestamp column.|
||Integer||Maximum time in minutes after which a session is broken.|
Sessionise object instantiated, the
assign_sessions() function can then be called. This function supports multi-processing, enabling you the split job into multiple processes to take advantage of a multi-core CPU.
||Integer||Number of processes to spawn to enable parallel processing. If set to
assign_sessions() function returns the DataFrame, with an additional column added storing the unique identifier for the session. Rows of the DataFrame can then be grouped using this column.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size markovclick-0.1.2-py3-none-any.whl (11.3 kB)||File type Wheel||Python version py3||Upload date||Hashes View|
|Filename, size markovclick-0.1.2.tar.gz (420.9 kB)||File type Source||Python version None||Upload date||Hashes View|
Hashes for markovclick-0.1.2-py3-none-any.whl