These days everyone is talking about smart applications.
One very simple feature that smart applications have is measuring user interactions.
Learning from user interactions and acting in a more personalized manner towards the user.
User interaction can mean different things for different applications. Here i am going to talk about one popular user interaction metric.
"Time spent by a user on a given feature"
Assuming you have some way of measuring the time spent by a user on a given feature. You can calculate the average time spent by a user and compare it with the time spent by other realistic users by using some statistics.
Assuming you have a list of users and their corresponding time's spent on the feature.
You can calculate the mean time for the list.
Lets call this mean_time.
You can also calculate the standard deviation for the list.
Lets call this time_range_delta
you actual time_range interval is then (mean_time - (time_range_delta * range_factor), mean_time + (time_range_delta * range_factor))
where range factor is the amount spurious information you are will to tolerate a range of [1-3] for this factor is generally considered good.
once you have this range interval, you can ignore all times that fall outside this range interval.
this will give a new list, from which you can calculate the mean and standard deviation again.
By following this process iteratively you can get the actual list of genuine users and their corresponding times.
Calculating the mean of this list will give the average time spent by the user.
You can then classify any user by using this average time.
Tuesday, January 26, 2010
Subscribe to:
Post Comments (Atom)
Labels
. linux
(1)
algorithm
(15)
analytics
(1)
bash
(2)
bigoh
(1)
bruteforce
(1)
c#
(1)
c++
(40)
collections
(1)
commands
(2)
const
(1)
cosine similarity
(1)
creating projects
(1)
daemon
(1)
device_drivers
(1)
eclipse
(6)
eclipse-plugin-development
(9)
equals
(1)
formatting
(1)
freebsd
(1)
game programming
(1)
hashcode
(1)
heap
(1)
heaps
(1)
immutable-objects
(1)
java
(19)
JDT
(1)
kernel
(1)
linux
(4)
little sugar
(23)
logging
(1)
machine learning
(1)
marker-resolution
(1)
markers
(1)
mergesort
(1)
mixins
(1)
numbers
(1)
opengl
(2)
patterns
(2)
priority-queue
(1)
programming
(51)
ps
(1)
ranking
(1)
refactoring
(3)
references
(1)
security
(1)
set
(1)
shell
(1)
similarity
(1)
statistics
(1)
stl
(1)
tetris
(1)
threads
(1)
trees
(2)
unicode
(1)
unix
(2)
views
(2)
windows programming
(2)
XNA
(1)
No comments:
Post a Comment