0
10
20
30
40
50
60
70
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
2.2
2.4
0
10
20
30
40
50
60
70
80
90
100
Recall (%)
Comparison of USN solutions
Pareto Front
Top-5
Best
Energy (mJx10
-3
)
Time (s)
Recall (%)
Figure 2: Optimal and Top-k solutions compared to the
Pareto-Front (PF) solutions provided by USN.
was augmented with the user’s social data content of
Facebook. Finally, in order to introduce mobility in
our experiments, we have utilized a publicly available
real dataset by Microsoft Research Asia GeoLife,
which includes 1,100 trajectories of a human moving
in the city of Beijing over a life span of two years
(2007-2009). At each timestamp, we select a user u
i
as the query user and execute the following query (in
SQL-syntax:
Q
= ``SELECT * FROM Users WHERE keyword
LIKE
filter
''
, where filter is a keyword.
We study the Pareto-Front (PF) solutions provided
by the USN framework. More specifically, we compare
the fitness error provided by the best solution and the
top-k solutions. In Figure 2, we demonstrate the results
for a single timestamp (τ=19) for all solutions in the
system-oriented objective space with the Energy,Time
and Recall metrics. The PF solutions are represented by
solid circles. The Top-k (k=5) solutions and the best so-
lution are represented by diamonds and a solid triangle,
respectively.
We observe that the Top-k solutions, w.r.t. the fitness
error provided by the USN framework, almost spread
across the whole system-oriented objective space. This
is important as it enables the network decision maker
to efficiently tune the system according to specific net-
work requirements (e.g., low energy is more impor-
tant than low time and high recall objectives) provid-
ing at the same time near-optimal user-oriented fitness.
The execution time required for generating the solutions
was ≈32562±3409ms, which is not applicable for sys-
tems requiring realtime performance. However, cloud-
computing or parallel processing can alleviate this prob-
lem by evaluating each solution in each generation in-
dependently. Since network operators typically employ
server farms that feature thousands of processing cores
running in parallel, the execution time can be reduced
by several orders of magnitude thus offering realtime
performance.
5 CONCLUSIONS
In this paper, we introduced User-centric Social Net-
work (USN), a novel framework that incorporates user-
oriented objectives in the search process. We presented
the initial design of the USN framework as well as a
preliminary evaluation, which demonstrates that USN
enhances usability and satisfaction while in parallel op-
timizing the performance of the network w.r.t. energy,
time and recall.
ACKNOWLEDGEMENTS
This work is partly supported by the European Union
under the project CONET (#224053), and the project
FireWatch (#0609-BIE/09), sponsored by the Cyprus
Research Promotion foundation.
REFERENCES
Andreou, P., Zeinalipour-Yazti, D., Pamboris, A., Chrysan-
this, P., and Samaras, G. (2011). Optimized query
routing trees for wireless sensor networks. Informa-
tion Systems Journal, 36(2):267–291.
Brusilovsky, P. (2001). Adaptive hypermedia. User Model-
ing and User-Adapted Interaction, 11:87–110.
Chaudhuri, S. and Deb, K. (2010). An interactive evolution-
ary multi-objective optimization and decision making
procedure. Applied Soft Computing, 10(2):496–511.
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. (2002).
A fast and elitist multiobjective genetic algorithm:
NSGA II. IEEE TEC, 6(2):182–197.
Germanakos, P., Tsianos, N., Lekkas, Z., Mourlas, C., and
Samaras, G. (2008). Realizing comprehensive user
profile as the core element of adaptive and personal-
ized communication environments and systems. The
Computer Journal, 52(7):749–770.
Graf, S. and Kinshuk (2009). Advanced adaptivity in
learning management systems by considering learn-
ing styles. In IEEE/WIC/ACM, volume 3.
Konstantinidis, A., Charalambous, C., Zhou, A., and Zhang,
Q. (2010a). Multi-objective mobile agent-based sen-
sor network routing using MOEA/D. In IEEE CEC.
Konstantinidis, A., Yang, K., Zhang, Q., and Zeinalipour-
Yazti, D. (2010b). A multi-objective evolutionary
algorithm for the deployment and power assignment
problem in wireless sensor networks. Elsevier Com-
puter Networks, 54:960–976.
Lankhorst, M., Kranenburg, A. S., and Peddemors, A.
(2002). Enabling technology for personalizing mobile
services. In HICSS, volume 3, page 87.
Zhang, Q. and Li, H. (2007). MOEA/D: A multi-objective
evolutionary algorithm based on decomposition. IEEE
TECC, 11(6):712–731.
WEBIST2012-8thInternationalConferenceonWebInformationSystemsandTechnologies
798