Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Correlating user interests and location in a mobile network US 8229470 B1

Correlating user interests and location in a mobile network US 8229470 B1

Ratings: (0)|Views: 19 |Likes:
Published by StopSpyingOnMe
Correlating user interests and location in a mobile network
US 8229470 B1
Correlating user interests and location in a mobile network
US 8229470 B1

More info:

Published by: StopSpyingOnMe on Aug 21, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

09/09/2013

pdf

text

original

 
US008229470B1
O
(12)
United
States
Patent
(10)
Patent
N0.:
US
8,229,470
B1
Ranjan
et
al.
(45)
Date
ofPatent:
Jul.
24,
2012
(54)
CORRELATING
USER
INTERESTS
AND
OTHER
UBLICATIONS
LOCATION
N
A
MOBILE
NETWORK
Verhein,
F.,
et
a1,
“Mining
Spatio-Temporal
Association
Rules,
Sources,
Sinks,
Stationary
Regions
and
Thoroughfares
in
Object
(75) Inventors:
Supranamaya
Ranjan,
Albany,
CA
Mobility
Databases»,
(Us);
Antonio
Nllcci,
San
Jose,
CA
In
Proc.
of
the 11th
International
Conference
on
Database
Systems
(US);
Aleksandar
Kuzmanovic,
for
Advanced
Applications,
2006.
Evanston,
IL
(US);
Ionut
Trestian,
lg’lalik,
liténdffhl
et
81»
“czlngouf
1211161
fTgXtuIe
Ang?is
fgdgnage
Evanston
IL
(Us)
egmentation
,
nternation
_
ourn_ o
omputer
ision
,
PP.
7-27,
2001,
Kluwer Academic
Publishers,
The
Netherlands.
_
Eagle,
Nathan,
“Realitymining:sensing
complex
social
systems”,
(73)
Asslgneei
Narns,
Ince
Sunnyvale,
CA
US)
Pers
Ubiquit
Comput
(2006)
10,
pp.
255-268,Published
online:
Nov.
3,
2005,
Springer-Verlag
London
Limited
2005.
(
>x<
)
Notice: Subject
to
any
disclaimer,
the
term
ofthis
Golle,
Philippe,
et
al.,
On
the
Anonymity
of
Home/Work
Location
patent
is
extended
or adjusted
under
3
5 Pairs”,Proceedings
of
the
7th
International
Conference
on
Pervasive
Computing,
May
1-14,
2009, Nara,
Japan.
U'S'C'
154(1))
by
90
days‘
Miklas,
Andrew
G.,
et
a1.
“Exploiting
Social
Interactions
in
Mobile
Systems”.
In
UBICOMP
(Ubiquitous
Computing),
Innsbruck,
Aus
(21)
Appl.
No.:
12/910,731
tfia,
Sell
200?
Kandula,
Srikanth,
et
al.,
“What’s
Going
on? Learning
Communica
. _
tion
Rules
in
Edge
Networks”.
In
Proceedings of
SIGCOMM
008,
(22)
Flled-
Oct-
22
2010
Aug.
17-22,
2008,
Seattle,
WA.
Continued)
51)
Int.
Cl.
(
H04
24/00
(2009.01)
. . .
52
U
Cl
455/456
3-
709/203- 709/223-
PnmaryExammer
T
msong
Hu
( )
' ' '
""""""""""
'
Assistant
Examiner
*
enjamin
orales Fernandez
709/207; 715/757;
705/710
. .
_ _ _
(74) Attorney,
Agent,
or
Ftrm
*
ernandez
&
ssociates,
(58)
Field of
Classi?cation
Search
......................
..
None
LLp
See
application ?le
for
complete
search
history.
(57)
ABSTRACT
(56)
References Cited
A
ethod
for
providing
location
based
service
in
a
cellular
data
service
network
(CDSN)
by
analyzing accounting
data
U~S~
PATENT
DOCUMENTS
packets
of
the
CDSN
o
determine
a
user mobility
pattern,
7,096,030
B2
8/2006
H_uomo
....................
..
455/4563
classifying application data
packets
of
the
CDSN
nto
pre
gg
:
£11m
ethél
determined
application
categories,
analyzing
the
accounting
, ,
ayas
i
e
a
.
~ ~ -
8,108,501
B2
*
1/2012
Birnie
et
al.
................
..
709/223 data
pac?ls
and
the
appélcano?d?ta
Page“
o
.assgclatithe
2004/0162090
A1
*
8/2004 Suryanarayana
et
al.
.
455/4565
11561
m0
1W
Pattem a? one
0
I
6
Pre_-
etelmlne
‘211313
10a
2004/0172409
A1*
9/2004
James
......................
,,
707/
104,1
tion
Category,
comparing
a
newly
received
accounting
data
2006/
0022048
Al
2/
2006
Johnson
.
235/4621 packet
and
he
user mobility
pattern
to
identify
a
match,
and
2007/0270166
A1
11/2007
Hampel
t
a1~
~
455/4563
providing,
in
response
to
identifying
the
match,
the
location
2009/0125230
A1
5/2009 Sulhvan
""
701/207
based
service
to
a
user
based
on
he
re-determined
a
lica
2009/0177523
A1
7/2009
Routtenberg
705/10
.
P
PP
2009/0298513
A1
*
12/2009
Hampel
et
al.
.
455/4561
non
Category
2010/0057562
A1
3/2010
Gabbay
.
705/l4.52
2010/0131584
A1*
5/2010Johnson
......................
..
709/203
18 Claims,
9
Drawing
heets
Use:
Mon/Hy
‘az1-sr-z
we
lea-iron
Categew
Cor/Bimbo
To
"0
 
US
8,229,470
B1
Page
2
OTHER
PUBLICATIONS
Spielmat,
Daniel
A.,
et
al,
“Spectral
partitioning
works:
planar
graphs
and
?nite
element meshes”, Proceedings
of
the
37th
Annual
Sympo
sium
on
Foundations
of
Computer
Science,
p.
96,
Oct. 14-16,1996.
Agrawal
Rakesh,
et
al.,
“Mining
Sequential
Patterns”,
Proceedings of
the
Eleventh
International
Conference
on
Data
Engineering,
pp.
3-14,
Mar.
6-10,
1995.
Karagiannis,
Thomas,
et
al.,
“Power
law and
exponential
decay
of
inter
contact
times
between
mobile
devices”,
Proceedings
of
he13thannual
ACM
n
international
conference
on
Mobile computing and
networking,
Sep.9-14,
2007,
Montréal,
Québec,
Canada.
Brockman,
D.
et
al.,
.
Brockmann,
L.
Hufnagel,
and
.
Geisel.
The
Scaling
Laws
of
Human
Travel. In
Nature,
439(7075),
Jan.
2006.
Gonzalez,
M.,
et
al.,
“Understanding
Individual
Human
Mobility
Patterns”.
In
Nature,
453(7196),
Jun.
2008.
Dhillon,
Inderj
t
S.,
Co-clustering
documents and words
using
bipar
tite
spectral
graph
partitioning,
Proceedings of
the
seventh
ACM
SIGKDD
nternational
conference
on
Knowledge
iscovery
and
data
mining,
p.
269-274,
Aug.
26-29,2001,
San
Francisco,
California.
Kernighan,
B.,
et
al.,
“An
fficient
Heuristic
Procedure
for
Partition
ing
Graphs”.
In
the
Bell
System
Techincal
Journal,
vol.
29,
1970.
Chaintreau,
Augustin,
et
al.,
“Impactof
Human
Mobility
on
the
Design
of
Opportunistic
Forwarding
Algorithms”,
IEEE
Transac
tions
on
Mobile
Computing,
v.6n.6,
pp.
606-620,
Jun.
2007.Lee,
Kyunghan,
et
al.
“SLAW:
A
obility
Model
or
Human
alks”.
In
INFOCOM,
Rio de
Janeiro,Brazil,
Apr.
2009.
*
cited
by
examiner
 
US.
Patent
Jul.
24,
2012
Sheet
1
of9
US
,229,470
B1
W.
w
.
5%
,
ma
w
,
m
gm
ms
4;,ug
wmmm

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->