Академический Документы
Профессиональный Документы
Культура Документы
Yacine Atif
Quan Z. Sheng
Zakaria Maamar
College of IT
UAE University
Al Ain, UAE
yacine.atif@uaeu.ac.ae
College of IT
Zayed University
Dubai, UAE
zakaria.maamar@zu.ac.ae
I.
INTRODUCTION
377
scalable framework to encompass the heterogeneity of realworld things and their functions by abstracting things within
AS [3]. While the adoption of real-world things into the Web
becomes a reality and the mashup of things are being
explored [10, 11], a suitable application platform for the
mashup of people, things and their interactions is now of
prime importance. The behavior of things in relation to their
social interactions needs to be studied for the benefit of
industry and businesses.
The social networking platform is ideal for the
composition and use of Web services [12]. The adoption of
the social networking platform to integrate real-world things
was proposed [13], but the approach is restricted to
exploiting the access restrictions offered by existing social
networking platforms to ensure privacy of things and their
users. Moreover, the approach does not look at things as
autonomous entities of the social network without human
intervention. Here, we propose to use the social networking
platform to realize the Social Web of Things (SWoT) and
create communities of things based on similarities found
among things. We also explore the behavior of things within
a community to enhance future business scenarios.
II.
B. Related Work
The vision of ubiquitous computing [6] is being realized
with the abstraction of real-world things into the Web and its
effect is driving research trends towards realizing ubiquitous
computing [7, 8]. The impact that this has when integrating
with enterprise applications [9] has been suggested with
possible architecture to realize the benefits. However the
large-scale impact and the behavior of these things within
such environments are yet to be studied. We proposed a
378
WOM-Annotations
s[0
ag
sT
WOM-Object
ha
hasFriend[0..n]
o
isL
cat
WOM-Processes
n]
0. .
[
s
s
ce
ro
sP
a
h
WOM-Communication
[0..n]
hasMedium
WOM-Capability
hasS
torag
e[0..
n]
WOM-Storage
hasID [1..n]
WOM-Location
..n
]
FOAF
ed
-In
isCapable-O
hasInformation
WOM-Profile
WOM-ID
379
<?xml version="1.0"?>
<rdf:RDF xmlns:rdf=http://www.w3.org/1999/02/22-rdf-syntax-ns# xmlns:moat=http://moat-project.org/ns#
xmlns:foaf=http://xmlns.com/foaf/0.1/ xmlns:wom=http://www.samsasm.com/wom#
xmlns:car="http://www.samsasm.com/car#">
<rdf:Description rdf:about="http://www.samsasm.com/dish/Omida">
<wom:profile>
<wom:static>
<car:itemcode>Car5AWS12</car:itemcode>
<car:country>USA</car:country>
<car:company>Ondah</car:company>
<car:year>2013</car:year>
</wom:static>
<wom:dynamic>
<wom:owner>Sams</wom:owner>
<wom:tags>
<moat:Tag>
<moat:name>Great Car!</moat:name>
<moat:hasMeaning>
<moat:Meaning>
<moat:meaningURI rdf:resource="http://dbappliance.org/resource/car"/>
<foaf:maker rdf:resource="http://socialnetpeople.com/gibbs"/>
</moat:Meaning>
</moat:hasMeaning>
</moat:Tag>
</wom:tag>
</wom:dynamic>
</wom:profile>
</rdf:Description>
</rdf:RDF>
Web-Object
Handler
Control
and
Monitor
HTML
Update
State and
Functions
Adapter
View
RESTful URIs
Over Wi-Fi
XML
Web Smart
Tag
Control
Real-World
Thing
III.
380
www.cosm.com
T4
T2
T5
T16
T15
T14
T13
AS 3
Social
Web
AS 131
T12
T11
T17
C. Clustering Algorithm
In our approach to cluster real-world things, we propose
the use of k-means algorithm [16, 17] to compare and cluster
the WOM-Profiles of Web Smart things. The k-means
algorithm is iterative and commonly used for clustering in
applications with large data sets. There have been various
attempts to improve the efficiency of k-means algorithm
[18]. Here, we are not focusing on the efficiency of the
algorithm but rather on the possibility of creating clusters
from large data sets that the WoT would generate.
The algorithm is used to partition a given set of WOMProfiles into k clusters. Here, the algorithm is applied to the
grouping of things that are represented by an n-dimensional
vector space. The algorithm clusters a set of vectors that
represent WOM-Profiles, = | = 1, 2, , , where
, which is the things in an AS.
In k-means, each projected cluster (AS) is represented by
a cluster centroid or seed. We denote the set of cluster
representatives as =
| = 1, 2, , . The k-means
algorithm attempts to minimize the total Euclidean distance
between each thing and its closest seed
. The algorithm
for clustering m un-clustered things is shown below.
381
Proc createCluster(dn)
Input: Cl: the set of clusters with similar static parameters
Input: Vm: the set of clusters with similar dynamic parameters
Input: $ : static similarity function
Input: % : content similarity function
Input: & : functional similarity threshold
Input: ': tag-based similarity threshold
Auxiliary: i, j, k: integer
Begin
- Initialize k seeds from W
- Use these k seeds as initial set of cluster representatives C
For each wi do
If (
/ $ ( ,
) > &) then
-
=
{ }
- Calculate cluster mean cj
Else
If (- // % ( , - ) > ') then
- - = - { }
- Calculate cluster mean vk
Else
= { } and / = / { }
End if
End if
End for
End
Purity (, ) =
max
382
Where """
t 0 and t"""3 are m-dimensional vectors representing
two distinct Web Smart things over the term set T = {t1 , . . . ,
tm } associated with all Web Smart things.
IV.
Existing Customers
100
80
60
Customers
Reached
40
20
0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
Cluster Purity
V.
CONCLUSION
383
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
384