A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
Are web users really Markovian?
2012
Proceedings of the 21st international conference on World Wide Web - WWW '12
Our main result invokes statistical order estimation tests for Markov chains to establish that Web users are not, in fact, Markovian. ...
User modeling on the Web has rested on the fundamental assumption of Markovian behavior -a user's next action depends only on her current state, and not the history leading up to the current state. ...
INTRODUCTION The Markovian model for Web user behavior posits that when a user is browsing a Web page P , the next page she visits depends only on P and not on how the user arrived at P . ...
doi:10.1145/2187836.2187919
dblp:conf/www/ChierichettiKRS12
fatcat:7u7bhgkv6jatffiaivy45qlnei
A Markovian Approach for Web User Profiling and Clustering
[chapter]
2003
Lecture Notes in Computer Science
The objective of this paper is to propose an approach that extracts automatically web user profiling based on user navigation paths. ...
Web user profiling consists of the best representative behaviors, represented by Markov models (MM). ...
In the data collections, we have a relation table with 200 attributes, and few of them are really useful to achieve our objective. ...
doi:10.1007/3-540-36175-8_19
fatcat:ldr26agg5rhlvoqrfginxus4iy
Scheduling of users with markovian time-varying transmission rates
2013
Performance Evaluation Review
show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. ...
We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and ...
It is really interesting to observe the way in which the different policies treat the two classes. ...
doi:10.1145/2494232.2465550
fatcat:3arkymg35jcjpnqqx4jutdwewy
Scheduling of users with markovian time-varying transmission rates
2013
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems - SIGMETRICS '13
show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. ...
We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and ...
It is really interesting to observe the way in which the different policies treat the two classes. ...
doi:10.1145/2465529.2465550
dblp:conf/sigmetrics/CecchiJ13
fatcat:mioz6aauavh7vadifm6ywhhfby
Nearly-optimal scheduling of users with Markovian time-varying transmission rates
2016
Performance evaluation (Print)
We first focus on three-state channels and show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. ...
We consider Markovian channel dynamics, relaxing the common but unrealistic assumption of i.i.d. channels. ...
A class of users could, for instance, identify users located at the same physical properties (e.g. distance, obstacles), requesting to download the same type of file (e.g., video, mp3, web page, etc.), ...
doi:10.1016/j.peva.2016.02.002
fatcat:ua6edhzlurfilj7fra5mepbi34
Decision-Theoretic Planning with non-Markovian Rewards
2006
The Journal of Artificial Intelligence Research
In decision-theoretic planning, where many desirable behaviours are more naturally expressed as properties of execution sequences rather than as properties of states, NMRDPs form a more natural model than ...
the commonly adopted fully Markovian decision process (MDP) model. ...
Given a description of the actions in a domain, nmrdpp lets the user play with and compare various encoding styles for non-Markovian rewards and search control knowledge, various translations of the resulting ...
doi:10.1613/jair.1676
fatcat:zf7e3w3yirhytcfwrx2hjvtdfe
Using Markov Models to Define Proactive Action Plans for Users at Multi-viewpoint Websites
[chapter]
2004
Lecture Notes in Computer Science
The difficulty is even greater when dealing with web users and when decisions have to be taken on-line and salesmen are not involved. ...
Research is partially supported by Universidad Politécnica de Madrid (project Web-RT) and MCYT under project DAWIS ...
Acknowledgments The research has been partially supported by Universidad Politécnica de Madrid under Project WEB-RT Doctorado con Cali. ...
doi:10.1007/978-3-540-25929-9_95
fatcat:wwroeywsbnggdcmc6fkzykpsde
Markovian codon models of evolution for phylogeny inference
2013
Deepest gratitude are also due to Prof. ...
Acknowledgement
Acknowledgments The authors are grateful to Ste ´phane Guindon for support with PhyML code and Ziheng Yang, Olivier Gascuel, and Gaston Gonnet for discussions on code optimization strategies ...
Chapter 5
Are Codon Models Really Better? Testing a model with data which was generated by the same model is a useful approach to check the consistency of the model assumptions. ...
doi:10.3929/ethz-a-009772928
fatcat:l6omajccwfaxnpull3i6ekxfpm
A Web User Profiling Approach
[chapter]
2003
Lecture Notes in Computer Science
This paper proposes characteristics of an idealized algorithm that would allow an automatic extraction of web user profil based on user navigation paths. ...
We describe a simple predictive approach with these characteristics and show its predictive accuracy on a large dataset from KDD-Cup web logs (a commercial web site), while using fewer computational and ...
In the data collections, we have a relation table with 200 attributes, and few of them are really useful to achieve our objective. ...
doi:10.1007/3-540-36901-5_24
fatcat:yvsrwqnc4faijegoyl4znru37i
Applying machine learning techniques to improve user acceptance on ubiquitous environement
[article]
2013
arXiv
pre-print
The adaptation procedures associate actions to perceived situations of the user. Associations are based on feedback given by the user as a reaction to the behavior of the system. ...
system and the user. ...
A × S → [0, 1] is the stochastic Markovian transition function. ...
arXiv:1301.4351v1
fatcat:5cjbyjrknva6dnhnq2rslbue3u
Found in Translation
[chapter]
2009
Lecture Notes in Computer Science
We present a complete working system that gathers multilingual news items from the Web, translates them into English, categorises them by topic and geographic location and presents them to the final user ...
The integration of Support Vector Machines, Statistical Machine Translation, Web Technologies and Computer Graphics delivers a complete system where modern Statistical Machine Learning is used at multiple ...
We are grateful to Simon Price and IRLT for their contribution to the web interface. This work is supported by the EU projects SMART and PASCAL2. Flaounas is supported by the A. S. ...
doi:10.1007/978-3-642-04174-7_55
fatcat:onoynbgvwbbkzbx2aajlig4rkq
On Scalable and Efficient Security Risk Modelling of Cloud Computing Infrastructure based on Markov processes
2017
ITM Web of Conferences
While cloud computing infrastructures proliferates in nowadays computing and communications technology there are few reports investigating models for their security. ...
In this paper, new efficient models are developed and evaluated for analyzing the security-related behavior of cloud computing architectures and networks comprising complex interconnected communication ...
non-Markovian models. ...
doi:10.1051/itmconf/20170903006
fatcat:p6bzpzro4bcznbuijavwznbt6y
The GENIUS Grid Portal and robot certificates: a new tool for e-Science
2009
BMC Bioinformatics
They are extremely useful for instance to automate grid service monitoring, data processing production, distributed data collection systems. ...
Methods: Robot certificates have recently been introduced to perform automated tasks on Grids on behalf of users. ...
When the results about the computations are available, the user can retrieve them using a conventional web browser. ...
doi:10.1186/1471-2105-10-s6-s21
pmid:19534747
pmcid:PMC2697645
fatcat:pesm7pg5izgr5dyiq2finrta5u
Quantitative Analysis of Web Services Using SRMC
[chapter]
2009
Lecture Notes in Computer Science
The methods are illustrated on a classical example of Web Service usage in a businessto-business scenario. Listing 1.5. SRMC model composition Client::Idle Service ...
In this tutorial paper we present quantitative methods for analysing Web Services with the goal of understanding how they will perform under increased demand, or when asked to serve a larger pool of service ...
The authors are supported by the EU FET-IST Global Computing 2 project SENSORIA ("Software Engineering for Service-Oriented Overlay Computers" (IST-3-016004-IP-09)). ...
doi:10.1007/978-3-642-01918-0_8
fatcat:5vwvmjnib5dx3fazxy7hemc5fy
Aggregated Quantified Response Time Matrix Formulation (ARMF) - A New Quality of Service Paradigm Technique
2015
Journal of Software
It provides the user-response matrix where every entry in the matrix depicts the QoS value of the service opted by the user. ...
The goal of QoS is to select the appropriate web services for the customers achieve their goals. ...
Constrained Web Services QoS values are given by the active users, while the comparative users become more vital when more QoS values are accessible for the active users. ...
doi:10.17706//jsw.10.9.1070-1078
fatcat:rt5ozlfvzfaypii7zpiqpgblse
« Previous
Showing results 1 — 15 out of 673 results