4.2.1 Structure of an S-Node Representation
S-Node representation divides nodes of graphs into
classed, each class of nodes is called supernode.
Two-level S-Node representation of the Web graph
as shown in Figure 6.
Supernode graph contains n vertices (call
supernodes), one for each element of the partition.
Supernodes are linked to each other using directed
edges (called superedges). Superedges are created
based on the following rule: There is a directed
superedge E
i,j
from N
i
to N
j
if there is at least one
page in N
i
that points to some page in N
j
.
Each partition is associated with an intranode
graph. IntraNode
i
represents all the interconnection
between the pages that belong to N
i
.
Figure 6: S-Node representation of a Web graph.
4.2.2 Apply S-node Graph with Learning
Objects Indexing and Categorizing
To represent relation between learning objects and
curriculum of a course by using S-node algorithm,
we define each learning object as a node in lower
level while chapters are super nodes in top level. In
figure 7, for clustering learning resources, we follow
S-node algorithm. This approach will be done
automatically and dynamically by the system.
Figure 7: Learning objects represented with S-node graph.
5 CONCLUSIONS
Our work is addressed the problem of efficiently
way to share learning materials or pedagogical
resources and how to representation courses with
several types of resources. We apply S-node graph,
which provides highly space-efficient and reduce
query execution time, and ontology model. This
work is in progress and we plan to extend the model
and hope to realize some experiments.
REFERENCES
Bastide, G., Pompidor, P., Hérin, D., and M. Sala. (2004).
Integration of an Ontology Manager to Organize the
Sharing of Learning Objects in a Peer-to-Peer
Network: Proceeding of SW-EL'04 Workshop on
Applications of Semantic Web Technologies for E-
Learning in Conjunction with ISWC'04, International
Semantic Web Conference, Hiroshima, Japan, 11-16.
Bich-Lien, D., Yolaine B., and Nacera, B., (2004). “Using
OWL to Describe Pedagogical Resources”.
ICALT’04: Proceeding of the IEEE International
Conference on Advance Learning Technology.
Joensuu, Finland.
Brase, J., and Nejdl, W. (2003). “Ontologies and Metadata
for eLearning” in Handbook on Ontologies, Springer-
Verlag.
IEEE LOM (2002). Institute of Electrical and Electronics
Engineers, Inc., Draft Standard for Learning Object
Metadata., New York, USA, 2002.
Kolovski, V., Jordanov, S., and Galletly, J. (2004). An
Electronic Learning Assistant: Proceeding of
International Conference on Computer Systems and
Technologies CompSysTech’2004, Rousse, Bulgaria,
June, 17-18.
Merceron, A., Oliveira, C., Scholl, M., and Ullrich, C.
(2004). “Mining for Content Re-Use and Exchange –
Solutions and Problems”.
Ogbuji, U., 2006. Thinking XML: Learning Objects
Metadata.http://www.128.ibm.com/developerworks/x
ml/library/x-think21.html
Raghavan. S., and Garcia Molina, H. (2003).
“Representing web graphs”, ICDE'03: Proceeding of
the 19th International Conference on Data
Engineering. 405-416.
Santos, J., Anido, L., and Llamas, M. (2003). On the
Application of the semantic Web Concepts to
Adaptive E-learning: Proceeding of the 3rd IEEE
International Conference on Advance of Learning
Technologies (ICALT’03), July 09-11, 480-489.
Top level
graph
Supernode
Supernode
Superedge
S
u
p
e
r
e
d
g
e
Lower
level
directed
graphs
PEDAGOGICAL RESOURCES REPRESENTATION IN RESPECT IN ONTOLOGY AND COURSE SECTION
535