<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Trust-based Social Recommender for Teachers</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Soude Fazeli</string-name>
          <email>Soude.fazeli@ou.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hendrik Drachsler</string-name>
          <email>hendrik.drachsler@ou.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francis Brouns</string-name>
          <email>francis.brouns@ou.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Sloep</string-name>
          <email>peter.sloep@ou.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Open Universiteit in the Netherlands, Centre for Learning Sciences and Technologies</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <fpage>49</fpage>
      <lpage>60</lpage>
      <abstract>
        <p>Online communities and networked learning provide teachers with social learning opportunities to interact and collaborate with others in order to develop their personal and professional skills. In this paper, Learning Networks are presented as an open infrastructure to provide teachers with such learning opportunities. However, with the large number of learning resources produced everyday, teachers need to find out what are the most suitable resources for them. In this paper, recommender systems are introduced as a potential solution to address this issue. Unfortunately, most of the educational recommender systems cannot make accurate recommendations due to the sparsity of the educational datasets. To overcome this problem, we propose a research approach that describes how one may take advantage of the social data which are obtained from monitoring the activities of teachers while they are using our social recommender.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The Internet provides teachers with a social space to interact and access resources in
the form of either knowledge content or knowledgeable people outside their school
[
        <xref ref-type="bibr" rid="ref11">28</xref>
        ], [13]. Online learning communities and networked learning are increasingly
accepted by teachers as opportunities to continuously develop their personal and
professional skills [11], [7]. Learning Networks (LN) are online social networks that follow
the main goal of professional online communities for lifelong learners such as
teachers, who need continuous support and guidance to develop themselves both personally
and professionally [
        <xref ref-type="bibr" rid="ref12">29</xref>
        ]. Learning Networks can provide teachers with an open
infrastructure not only to share, annotate, rate and tag content, but also to exchange
knowledge and experience with the other members of the LN. Learning from others in
a social context is a promising form of learning, which motivates learners to
continuously learn and exchange knowledge. Research has shown the positive effects of
social learning [
        <xref ref-type="bibr" rid="ref14">31</xref>
        ], [8], [4]. In this paper, we discuss how one may take advantage of
LNs as an infrastructure to support teachers as lifelong learners.
      </p>
      <p>
        With the increasing amount of user-generated content produced everyday in the
form of learning resources, videos, discussion forums, blogs, etc., it becomes ever
more difficult for teachers to find the most suitable content for their needs. Moreover,
to support social learning, teachers need to be supported to find the most suitable
people who can help them to learn more effectively by sharing knowledge and
experiences [
        <xref ref-type="bibr" rid="ref14">31</xref>
        ]. Generally speaking, recommender systems have emerged as a practical
approach to provide a user with the most suitable objects based on their past
behaviour. Recommender systems have become popular because of their successful
applications in the e-commerce world such as in Amazon1 and eBay2. Fortunately, they can
be adjusted to be used also in the educational domain [10], [
        <xref ref-type="bibr" rid="ref4">21</xref>
        ].
      </p>
      <p>
        In general, recommender systems suggest items to a target user. They do so based
on the similarity between an item’s content description and the user’s preferences
model (content-based); or they measure similarity between user profiles to predict an
item’s rating for a target user based on the rating history of the users who are similar
to the target user (collaborative filtering). In this research, we take advantage of
collaborative filtering methods as we mainly focus on the interactions and collaborations
between teachers within a social environment. However, it is too difficult to compute
similarity of user profiles when there is no common set of ratings between the users or
when there are too little rating data available; this is known as the sparsity problem.
Educational datasets suffer from this problem more often than commercial datasets
[
        <xref ref-type="bibr" rid="ref15">32</xref>
        ]. Therefore, we need to find ways to overcome the sparsity problem in
educational datasets if it is our aim to enhance the performance of recommender systems in
learning. Social trust has been introduced to many recommender systems as a
response to the sparsity problem [14], [
        <xref ref-type="bibr" rid="ref19">36</xref>
        ], [16], [
        <xref ref-type="bibr" rid="ref2">19</xref>
        ], [17]. Ziegler and Golbeck [
        <xref ref-type="bibr" rid="ref19">36</xref>
        ]
show a strong connection between trust and similarity between users. In general, users
prefer to receive recommendations from the people they trust. Golbeck [14] shows
that trust captures not only simple overall similarity between users but also other
features of the profile similarity
      </p>
      <p>In teachers’ communities, teachers can perhaps be supported to find trustworthy
resources as proxies for reliable sources of information. Such trustworthy resources
enable teachers to feel more comfortable to share and interact within a closed and
trustful community. To achieve this, we follow a trust-based recommender system
proposed by [12] to create trust relationships between users based on the rating
information of user profile and item profile. Fazeli et al. [12] proposed a concept called
Tindex to measure trustworthiness of users in order to improve the process of finding
the nearest neighbours. The T-index is inspired on the H-index, which is used to
evaluate the publications of an author. The higher the T-index value of a user, the more
trustworthy the user becomes. Fazeli et al. showed how the T-index improves
structure of a generated trust network of users by creating connections to more trustworthy
users [12]. They computed the trust values between users based on the ratings users
gave to the items in their system. Although ratings’ information is one of the
examples of users' activities within a social environment, other social activities of users
also can be worthwhile and should not be ignored up front. In general, the social
activities of users describe each action of users within a social environment, for instance
browsing a Web page, bookmarking, tagging, making a comment, giving rating, etc.
1 http://www.amazon.com
2 http://www.ebay.com
We refer to the data that comes from the social activities of users, as “social data”. In
this research, we aim to enhance the existing trust-based recommender of Fazeli et al.
[12] by social data which are obtained from monitoring the activities of teachers while
they are using our social recommender.</p>
      <p>Therefore, the first research question is:</p>
      <p>RQ1: How can the sparsity problem within educational datasets be solved by using
inter-user trust relationships which originally come from the social data of users?</p>
      <p>Moreover, we aim to investigate the evolution of LNs while we collect social data
from users. Therefore, we need to study the structure of LNs for teachers to show how
using social data can help to cluster teachers more precisely and as a result to find the
most suitable content or people for their needs. So, the second research question is:
RQ2: How can teachers’ networks be made to evolve by the use of social data?
In the following section, we present the research methodology used to address
these two questions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Proposed research</title>
      <p>Our main objective is to support teachers to find the most suitable content or people
and do so more effectively. The idea is that through finding suitable peers and content
they will be better able to develop their personal and professional skills.</p>
      <p>
        In order to achieve this goal, we follow the methodology described by [
        <xref ref-type="bibr" rid="ref5">22</xref>
        ] for
recommender systems in TEL. We extend the methodology by first conducting an
interview study with teachers. The research work, therefore, consists of four steps: 1.
Requirement analysis (literature review and interview study), 2. Dataset-driven study ,
3. User evaluation study, 4. Pilot study. We will describe each step in terms of its
main goal, used methods, and the expected outcomes, in the following subsections.
2.1
      </p>
      <p>Requirement analysis (literature review and interview study)
• Goal. Besides a literature study on the issues and challenges teacher often face, we
organized interview group sessions with teachers and collected information from
them in order to investigate their main needs and requirements.
• Method. The interview group session was conducted using the nominal group
technique (NGT) [9]; the session took almost 2 hours and 45 minutes. The
participants were 18 teachers (novices, experts, mentors and supervising teachers) from
different schools in the Limburg area, the Netherlands, invited by Fontys
Hogeschool.
• Description. During the session, the participants were asked to write down their
ideas about the following question: “What kind of support do you need to provide
innovative teaching at your school?" Then, we asked them to discuss the ideas
generated and finally, to rank the ideas based on a five-point Likert scale (1 for the
least interesting idea and 5 for the most interesting one). The teachers generated
121 ideas in total. The clustering was done during the session by the researchers
(the alternative, to have the teachers do it, was rejected because of time
limitations). After the session, we invited the teachers to cluster the ideas in a Web-based
application called Websort3. The data are still being analysed.
• Expected outcomes. An inventory of teachers’ needs and requirements will be the
outcome of this step. This inventory list will be used to as an input to design a
recommender system which suits teachers’ needs the best.
2.2</p>
      <p>
        Dataset-driven study
• Goal. The main goal is to validate the framework we propose which presents the
important characteristics of a recommender system to be designed for teachers. We
will elaborate the framework in details in Section 3.
• Method. An offline empirical study of different algorithms on a selected set of
representative datasets is to be conducted. The offline experiments (data study) on
educational datasets will be in terms of the popular metrics often used to evaluate
the performance of recommender systems.
• Variables to be measured. Prediction accuracy and coverage of the generated
recommendations are the variables to be measured in this step.
• Description. Based on the literature review and the interview study, we present a
framework to identify the suitable recommender systems’ strategies to be applied
for our target users which helped us to make an effective selection of the available
educational datasets. The selected educational datasets for teachers to be studied
are TravelWell [
        <xref ref-type="bibr" rid="ref16">33</xref>
        ], MACE4, Organic.Edunet5, TELeurope6, OpenScout7,
digischool8 and eTwinning9.
• Expected outcomes. Initial results will indicate which of the recommender system
algorithms suits teachers best and if the trust-based recommender system can help
to deal with the sparse data in the used datasets.
2.3
      </p>
      <p>
        User evaluation study
• Goal. The goal is to study usability of the prototype by evaluating users’
satisfaction.
• Method. The experiment will be done by a questionnaire through which end-users
will be asked to provide feedback on the prototype.
3 http://uxpunk.com/websort/
4 http://portal.mace-project.eu
5 http://portal.organic-edunet.eu
6 http://www.teleurope.eu/
7 http://www.openscout.net
8 http://www2.digischool.nl/leerling/vo
9 http://www.etwinning.net/en/pub/index.htm
• Variables to be measured. User evaluation will be in terms of interestingness
(how much the end-users find the recommended content or people interesting) and
value-addedness (how recommended content or people can help users to gain new
knowledge or improve their current knowledge) [
        <xref ref-type="bibr" rid="ref15">32</xref>
        ].
• Description. Based on the outcomes, the prototype will be customized and
improved so as to be able to deploy an improved release in a pilot study.
• Expected outcomes. Initial feedback by end-users on usability of the prototype is
the outcome we expect.
2.4
      </p>
      <p>Pilot study
• Goal. We aim to deploy the final release to test it under realistic and normal
operational conditions with the end-users.
• Method. We compare the performance of a proposed recommender system based
on our presented framework with classical collaborative filtering algorithms.
Furthermore, we aim to study the structure of the teachers’ networks to investigate
how networks of teachers will evolve by use of social data. To evaluate the
effectiveness of the proposed recommender system, we will compare the results in
terms of total number of learning objects which have been visited, bookmarked,
rated, etc. for two groups of users:
! Those who are aided by recommender systems to access learning objects
! Those who access learning objects directly from the repository, without the help
of a recommender system.
• Variables to be measured. We will measure prediction accuracy and coverage of
the generated recommendations, effectiveness in terms of total number of visited,
bookmarked, or rated learning objects, as well as Indegree distribution used to
study how the structure of the networks changes. For a node on a network,
Indegree describes the number of coming edges (or relationships) to the node.
• Expected outcomes. We expect to obtain empirical data on prediction accuracy
and coverage, to validate whether our proposed recommender system outperforms
the classical CF algorithms. Another outcome will be the visualization of teachers’
networks, to show how the network’s structure evolves when relying on social
data.</p>
      <p>Having given an overview of the research method, we will now present the
state-ofthe-art in recommender systems to allow us to explore the characteristics which
should be taken into account to design a suitable recommender system for teachers.
3</p>
    </sec>
    <sec id="sec-3">
      <title>State-of-the-art</title>
      <p>
        Several reviews exist which detail how to study and classify recommender systems in
terms of recommendation techniques, tasks, delivery mode, etc [
        <xref ref-type="bibr" rid="ref5">22</xref>
        ]. However, each
of these reviews focuses only on some of the dimensions to classify recommender
systems and none of them present an integrated framework for the classification of
recommender systems. Manouselis and Costopoulou [
        <xref ref-type="bibr" rid="ref5">22</xref>
        ] propose a framework to
categorize the dimensions of recommender systems, which were identified in the
previous studies. We will use this framework to investigate the characteristics that
should be considered to design a recommender system for teachers. As shown in
Figure 1, the proposed framework consists of five main categories of characteristics:
Supported tasks, User model, Domain model, Personalization, and Operation. In the
rest of this section, we will introduce each of the characteristics briefly and we will
conclude how the resulting framework could be applied to a recommender system for
teachers.
As mentioned before, teachers need to keep informed about the resources which can
inspire them to deal with the issues they face in their job. So, we aim to support
teachers to Find Novel Resources which are suitable for them based on their profile
history. Most of the recommender systems in the educational domain have been
designed to support this task [
        <xref ref-type="bibr" rid="ref8">25</xref>
        ], [18], [
        <xref ref-type="bibr" rid="ref7">24</xref>
        ], [
        <xref ref-type="bibr" rid="ref14">31</xref>
        ], [10]. For more examples, refer to the
book by Manouselis et al. [
        <xref ref-type="bibr" rid="ref5">22</xref>
        ]. Moreover, teachers need to be supported to Find
Peers who can be trusted to share their concerns with them and to receive help from
them, so-called trustworthy peers. According to an extensive overview of the
recommender systems in the Technology Enhanced Learning (TEL) field provided by
Manouselis et al. [
        <xref ref-type="bibr" rid="ref5">22</xref>
        ], only few of the recommender systems aim to support this task
[
        <xref ref-type="bibr" rid="ref8">25</xref>
        ], [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
3.2
      </p>
      <sec id="sec-3-1">
        <title>User model</title>
        <p>
          We represent user profiles for teachers by history-based models and user-item matrix
which mainly focus on the past activities of the users such as ratings information [
          <xref ref-type="bibr" rid="ref8">25</xref>
          ],
[18], [10], [
          <xref ref-type="bibr" rid="ref5">22</xref>
          ]. Furthermore, we aim to create user profiles based on ontology to
provide more interoperability and openness among different platforms. Therefore, we
are going to use ontology to model the relationships between teachers in social
networks [12], [14]. The user profiles for teachers are generated based on the information
provided by the users when they themselves fill in a registration form with their
personal information (name, surname, email, etc.) and professional information (teaching
subject, interests, background knowledge, etc.). We refer to this part of the user
profile as static data as it can be edited manually by the users anytime they want to. The
other part of the user profiles contains recommendation data. It will be updated by our
system as soon as teachers start interacting with the system. Since our main objective
is to support teachers with a recommender system in the educational domain, we have
to take into account the teachers’ characteristics. So, to create a user model for
teachers, we need to consider both actions of teachers and context variables in the TEL
field [
          <xref ref-type="bibr" rid="ref17">34</xref>
          ]. Verbert et al. [
          <xref ref-type="bibr" rid="ref17">34</xref>
          ] describe the main characteristics that are to be
considered for users in an educational context, such as knowledge level, interests, goals and
tasks, and background knowledge, in addition to the data regarding users' actions in
terms of type and result of actions and the context in which an action has been taken.
        </p>
        <p>
          As indicated, we intend to take advantage of social data of users to deal with the
sparsity problem. To do so, we keep track of users' actions within our system,
socalled social activities, when they rate, tag, and bookmark content. In this way, the
recommendations will be generated and improved based on the recorded actions of
teachers while they interact with our system. As mentioned before, social data
originally comes from these recorded actions of users (teachers). To capture their social
data, we need to follow a standard specification to store and maintain their actions.
Several standard specifications to describe social data of users and guarantee their
interoperability exist. They are:
• FOAF. The FOAF (Friend-of-a-Friend) vocabulary [3] describes user’s
information and their social connections through concepts and properties in form of an
ontology using Semantic Web technologies [14]. The FOAF Vocabulary describes
personal information and social relationships. The FOAF Vocabulary shows basic
information of users (FOAF Basics) such as name, surname and also personal
information about the people that a user "knows" and its interest area (Personal Info).
In this research, we could extend the FOAF ontology to describe user profiles and
to model the social relationships between teachers by the concept of FOAF:agent.
• CAM. Contextualized Attention Metadata (CAM) is a format to capture
observations about users’ activities with any kind of tool [
          <xref ref-type="bibr" rid="ref18">35</xref>
          ]. A CAM schema aims to
store whatever has attracted users’ attention while the users are working with the
tool. It also stores users’ interaction with the tool such as rating, tagging, etc. A
CAM schema records an event and its details when a user performs an action
within a tool. The metadata stored in the CAM format describe all type of users’
feedback and, therefore, can be used to make recommendations for the users. We could
make use of the CAM schema to capture the users’ activities within our system and
as a result, to extract the social data of users in order to create user profiles.
Annotation scheme. In the context of Organic.Edunet10, Manouselis and Vuorikari
[
          <xref ref-type="bibr" rid="ref3">20</xref>
          ] developed a model to represent and store users’ feedback including rating,
tagging, reviewing, etc. in a structured, interoperable and reusable format. This
model is based on the CAM format. Manouselis and Vuorikari called it an
annotation scheme and proposed it as a structured and interoperable format to be used to
transfer the social data of users between heterogeneous systems. We could take
advantage of the annotation scheme to describe social data of users within our
system.
3.3
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Domain model</title>
        <p>Items to be presented to teachers need to be represented somehow and need to be
generated before they can be presented. This task is out of scope for the present
research project. It will, parenthetically, be taken up by the Open Discovery Space
project11 which aims to represent learning objects in the form of an integrated object
repository containing several collections of learning objects which are hosted by the
ARIADNE12 infrastructure.
3.4</p>
      </sec>
      <sec id="sec-3-3">
        <title>Personalization</title>
        <p>
          Method. In general, and as we already pointed out in Section 1, there are two main
types of algorithms used in recommender systems: content-based and collaborative
filtering. Content-based algorithms compare the description of an item with
representations of users’ interests. Amazon is a good example of such a recommender system,
which provides a so-called ‘favorites’ feature to represent the preferred items by
users. The ‘favorites’ are introduced as the content-based part of user profiles, which are
either manually provided by a user or are calculated based on purchase history of the
user [
          <xref ref-type="bibr" rid="ref6">23</xref>
          ]. As content-based algorithms make recommendations for a user only based
on the user’s interests individually, the user is less likely to find novel items which
might be interesting to the user [6]. Collaborative Filtering (CF) is another type of
recommender systems which purely depends on opinions and ratings of users instead
of actual content descriptions. CF algorithms search for like-minded users that are
introduced as neighbourhoods and they predict an item’s rating for a target user based
on collected ratings of the user’s neighbours [
          <xref ref-type="bibr" rid="ref10">27</xref>
          ]. They recommend a target user
topN recommended neighbours and/or items. Traditional CF algorithms form the
neighbourhoods based on similarity between user profiles [
          <xref ref-type="bibr" rid="ref8">25</xref>
          ], [
          <xref ref-type="bibr" rid="ref7">24</xref>
          ], [10], [
          <xref ref-type="bibr" rid="ref4">21</xref>
          ], [
          <xref ref-type="bibr" rid="ref16">33</xref>
          ].
        </p>
        <p>As mentioned before, traditional CF algorithms suffer from the sparsity problem if
too little rating information is available to compute similarity between users. Social
10 http://portal.organic-edunet.eu/
11 Open Discovery Space is a 7th framework European project partly sponsored the presented
research work in this document.</p>
        <p>
          12 http://www.ariadne-eu.org/repositories
trust has emerged as a solution to the sparsity problem in many recommender systems
[14], [
          <xref ref-type="bibr" rid="ref19">36</xref>
          ], [16], [
          <xref ref-type="bibr" rid="ref2">19</xref>
          ], [17]. In the research area of recommender systems, trustworthy
users have been introduced as like-minded users and thus, trust originates from
similarity between users. However, assuming that trust is transitive (if A trusts B and B
trusts C, then A trusts C), we may find a relationship between two users who have no
common set of items but do have friends in common. Suppose we have two users:
Alice and Carol who have no rated set of items in common. Therefore, it is not
possible to compute similarity between them. As a result, there will no direct relationship
between Alice and Carol even though they are already indirectly connected through
another user whose name is Bob. In this case, the inter-user trust phenomena helps us
to infer a relationship between Alice and Carol through their common friend Bob
because if Alice trusts Bob in his recommendations on papers and Bob also trusts
Carol in the same way then, Alice can trust Carol in her recommendations on papers.
This is how we define “trust” in this research work. Therefore, we form
neighbourhoods based on the trust relationships between users and we introduce the top-N
neighbours, commonly used in CF, as the most trustworthy users for a target user. To
do so, we are going to adjust an existing trust-based recommender system proposed
by Fazeli et al. [12] to make it suitable for an educational setting, particularly for
teachers. Furthermore, we aim to take advantage of social data of users described in
Section 3.2, to boost the performance of our proposed recommender system for
teachers.
        </p>
        <p>
          Type and Technique. CF methods are often categorized according to type or
technique. Type refers to memory-based and model-based algorithms; and technique
refers to user-based, item-based, and attribute-based approaches [
          <xref ref-type="bibr" rid="ref9">26</xref>
          ], [
          <xref ref-type="bibr" rid="ref11">28</xref>
          ].
Modelbased algorithms use probabilistic approaches to develop model of a user based on the
user’s history and profile. Examples of model-based algorithms are Bayesian
networks, neural networks, and algebraic approaches such as eigenvectors [16].
Although these algorithms are faster than memory-based algorithms, they require a full
set of users’ preferences to develop user models; such a set is often not available.
Moreover, model-based algorithms are often very costly for learning and updating
phases. Instead, memory-based algorithms are quite straightforward to use. They find
correlations between users based on statistical techniques for measuring similarity
such as Pearson correlations or Cosine similarities [2]. In this research, we aim to use
memory-based CF algorithms to recommend teachers the most suitable content or
people, based on the user-based techniques which focus on the similarity between
users in order to make recommendations [
          <xref ref-type="bibr" rid="ref11">28</xref>
          ].
        </p>
        <p>
          Output. Most of the recommender systems generate recommendations in the form of
suggestions on content or people, or sometimes ratings [
          <xref ref-type="bibr" rid="ref8">25</xref>
          ], [10], [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. Another
common output of recommender systems is predictions of a rating value that a user would
give to an item [
          <xref ref-type="bibr" rid="ref11">28</xref>
          ], [
          <xref ref-type="bibr" rid="ref16">33</xref>
          ].
3.5
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>Operation</title>
        <p>
          In this research, we intend to follow a centralized architecture, in which a central
recommender server provides access to a single learning object repository. The
recommendations are to be made at the recommender server (location) and are to be sent
to the teachers as part of natural interactions of the users within our system, for
example when the user browses a page or rates an item. In this way, teachers do not need to
ask to receive recommendations explicitly (passive mode) [
          <xref ref-type="bibr" rid="ref11">28</xref>
          ].
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion and further work</title>
      <p>In this paper, we described why teachers need to be supported to find the most
suitable content or people for their needs and we introduced recommender systems as a
potential solution to address this issue. We also argued that we need to overcome the
sparsity problem when we aim to enhance the performance of recommender systems
in the educational domain and particularly for teachers. Therefore, we presented our
research questions and research method that mainly focus on a solution to tackle the
sparsity problem. As part of our proposed research based on the literature study, we
proposed a framework that explores the main characteristics required to design a
recommender system approach that suits teachers’ needs the best. To validate this
framework, we already started to set up an offline empirical study to test different
algorithms of recommender systems on the selected datasets. As for the requirement
analysis, an interview study has been conducted for 18 teachers from the Netherlands
who already have been invited to cluster their ideas by Websort, following up the
group session we had with them (described in Section 2.1). Furthermore, we took
advantage of the Open Discovery Space Summer School in Greece, in July 2012 to
involve more teachers in the Websort study. As a result, we now have an extensive
analysis of the requirements for teachers all over the Europe. We are currently
investigating the data and will present outcomes of the study in a special issue of the
RecSysTEL workshop that will be published by Springer.</p>
      <p>Acknowledgements. We would like to thank Dr. Frank Crasborn for his kind help
and support in conducting the interview study. This paper is part of a doctoral study
funded by NELLL (the Netherlands Laboratory for Lifelong Learning at the OUNL)
and the Open Discovery Space project. Open Discovery Space is funded by the
European Union under the Information and Communication Technologies (ICT) theme of
the 7th Framework Programme for R&amp;D. This document does not represent the
opinion of the European Union, and the European Union is not responsible for any use
that might be made of its content.
Systems for Technology Enhanced Learning (RecSysTEL 2010), Volume 1, Issue 2, 2010,
Pages 2783-2792
2. Breese J. S., Heckerman D., and Kadie, C. Empirical analysis of predictive algorithms for
collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial
Intelligence (UAI 1998), pages 43–52, 1998.
3. Brickley D., Miller, L. (2004) FOAF vocabulary specification. Namespace Document,
pages 331–370
4. Brown J. S., Adler R. P. (2008). Minds on Fire: Open Education, the Long Tail, and</p>
      <p>Learning 2.0. EDUCAUSE Review, 43(1), 16-32.
5. Burke R. Hybrid Web Recommender Systems. In Brusilovsky, P., Kobsa, A., Nejdl, W.
(eds.). The Adaptive Web: Methods and Strategies of Web Personalization., Lecture Notes
in Computer Science, Vol. 4321, pp. 377-408, Springer, Berlin-Heidelberg, 2007.
6. Cantador I., Bellogín A., Vallet D.: Content-based recommendation in social tagging
systems. RecSys 2010: 237-240
7. Daly A. J., Moolenaar N. M., Bolivar J. M., Burke P. (2010) Relationships in reform: the
role of teachers' social networks. Journal of Educational Administration, 48(3), 359-391.
doi: 10.1108/09578231011041062
8. Dawson S. (2008). A study of the relationship between student social networks and sense
of community. Educational Technology &amp; Society, 11(3), 224-238.
9. De Vries F., Kester L., Sloep P., Van Rosmalen P., Pannekeet K., Koper R. (2005).
Identification of critical time-consuming student support activities in e-learning. Research in
Learning Technology (ALT-J), 13(3), 219-229.
10. Drachsler H., Pecceu D., Arts T., Hutten E., Rutledge L., Van Rosmalen P., Hummel H.,
Koper R.: ReMashed - Recommendations for Mash-Up Personal Learning Environments.
In: Cress, U., Dimitrova, V., Specht, M. (eds.): Learning in the Synergy of Multiple
Disciplines, EC-TEL 2009, LNCS 5794, Berlin; Heidelberg; New York: Springer, pp788-793,
2009
11. Duncan-Howell J.: Teachers making connections: Online communities as a source of
professional learning, British Journal of Educational Technology, Volume 41, Issue 2, pages
324–340, 2010
12. Fazeli S., Zarghami A., Dokoohaki N., Matskin M. (2010) Elevating Prediction Accuracy
in Trust-aware Collaborative Filtering Recommenders through T-index Metric and
TopTrustee lists, 300-309. In JOURNAL OF EMERGING TECHNOLOGIES IN WEB
INTELLIGENCE 2 (4).
13. Fox A., Wilson E., &amp; Deaney R. (2011). Beginning Teachers’ Workplace Experiences:
Perceptions of and Use of Support. Vocations and Learning, 1-24. doi:
10.1007/s12186010-9046-1
14. Golbeck J. Computing and applying trust in web-based social networks. PhD thesis,
University of Maryland at College Park, College Park, MD, USA, 2005.
15. Hirsch J. E. An index to quantify an individual’s scientific research output. PNAS,
102(46):16569–16572, November 2005.
16. Kamvar S., Schlosser M., Garcia-Molina H. (2003) The eigentrust algorithm for reputation
management in p2p networks. In Proceedings of WWW2003. ACM, 2003.
17. Lathia N., Hailes S., Capra L. Trust-based collaborative filtering. In IFIPTM 2008: Joint
iTrust and PST Conferences on Privacy, Trust management and Security, page 14,
Department of Computer Science, University College London, London, UK, 2008.
18. Lemire D., Boley H., McGrath S., Ball M. (2005). Collaborative Filtering and Inference
Rules for Context-Aware Learning Object Recommendation. International Journal of
Interactive Technology and Smart Education, 2(3).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Beham</surname>
            <given-names>G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kump</surname>
            <given-names>B</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ley</surname>
            <given-names>T</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lindstaedt</surname>
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>Recommending knowledgeable people in a work-integrated learning system</article-title>
          .
          <source>Proceedings of the 1st Workshop on Recommender</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          19.
          <string-name>
            <surname>Massa</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Avesani</surname>
            <given-names>P.</given-names>
          </string-name>
          , (
          <year>2007</year>
          )
          <article-title>Trust-aware recommender systems</article-title>
          .
          <source>RecSys '07 Proceedings of the ACM conference on Recommender systems, Pages</source>
          <volume>17</volume>
          -
          <fpage>24</fpage>
          , ACM New York, USA
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          20.
          <string-name>
            <surname>Manouselis</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vuorikari</surname>
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2009</year>
          )
          <article-title>What If Annotations Were Reusable: A Preliminary Discussion</article-title>
          .
          <source>ICWL</source>
          <year>2009</year>
          :
          <fpage>255</fpage>
          -
          <lpage>264</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          21.
          <string-name>
            <surname>Manouselis</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vuorikari</surname>
            <given-names>R</given-names>
          </string-name>
          .,
          <string-name>
            <surname>Van Assche F.</surname>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>Collaborative recommendation of elearning resources: an experimental investigation</article-title>
          .
          <source>JCAL</source>
          ,
          <volume>26</volume>
          (
          <issue>4</issue>
          ):
          <fpage>227242</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          22.
          <string-name>
            <surname>Manouselis</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drachsler</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verbert</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2012</year>
          ).
          <article-title>Recommender Systems for Learning book</article-title>
          , Springer, to appear.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          23.
          <string-name>
            <surname>Pazzani</surname>
            <given-names>M. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Billsus</surname>
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>Content-based recommendation systems</article-title>
          . In P. Brusilovsky,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kobsa</surname>
          </string-name>
          &amp; W. Nejdl (Eds.),
          <article-title>The adaptive web: methods and strategies of web personalization</article-title>
          (Vol.
          <volume>4321</volume>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>341</lpage>
          ): Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          24.
          <string-name>
            <surname>Rafaeli</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dan-Gur</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barak</surname>
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2005</year>
          )
          <article-title>Social Recommender Systems: Recommendations in Support of E-Learning</article-title>
          .
          <source>International Journal of Distance Education Technologies</source>
          ,
          <volume>3</volume>
          (
          <issue>2</issue>
          ),
          <fpage>29</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          25.
          <string-name>
            <surname>Recker</surname>
            <given-names>MM</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walker</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lawless</surname>
            <given-names>K</given-names>
          </string-name>
          (
          <year>2003</year>
          )
          <article-title>What do you recommend? Implementation and analyses of collaborative information filtering of web resources for education</article-title>
          .
          <source>Instructional Science</source>
          ,
          <volume>31</volume>
          (
          <issue>4</issue>
          /5):
          <fpage>299</fpage>
          -
          <lpage>316</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          26.
          <string-name>
            <surname>Sarwar</surname>
            <given-names>B. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karypis</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Konstan</surname>
            <given-names>J. A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Riedl</surname>
            <given-names>J.</given-names>
          </string-name>
          (
          <year>1998</year>
          )
          <article-title>Item-based collaborative filtering recommendation algorithms</article-title>
          .
          <source>In Proceedings of the 10th International World Wide Web Conference (WWW</source>
          <year>2001</year>
          ), pages
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          27.
          <string-name>
            <surname>Schafer</surname>
            <given-names>JB</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frankowski</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herlocker</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sen</surname>
            <given-names>S</given-names>
          </string-name>
          (
          <year>2007</year>
          )
          <article-title>Collaborative Filtering Systems</article-title>
          . In Brusilovsky P,
          <string-name>
            <surname>Kobsa</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neidl</surname>
            <given-names>W</given-names>
          </string-name>
          . (eds) The
          <source>Adaptive Web: Methods and Strategies of Web Personalization, Lecture Notes in Computer Science</source>
          , Vol.
          <volume>4321</volume>
          , pp.
          <fpage>291</fpage>
          -
          <lpage>324</lpage>
          , Springer-Verlag, Berlin Heidelberg New York.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          28.
          <string-name>
            <surname>Schafer</surname>
            <given-names>JB</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Konstan</surname>
            <given-names>JA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riedl</surname>
            <given-names>J</given-names>
          </string-name>
          (
          <year>2001</year>
          )
          <article-title>E-commerce Recommendation ApplicationsData Mining</article-title>
          and Knowledge Discovery,
          <volume>5</volume>
          :
          <fpage>115</fpage>
          -
          <lpage>153</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          29.
          <string-name>
            <surname>Schuck</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <article-title>Getting help from the outside: developing a support network for beginning teachers</article-title>
          ,
          <source>The Journal of Educational Enquiry</source>
          , Vol
          <volume>4</volume>
          , No 1 (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          30.
          <string-name>
            <surname>Sloep</surname>
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2009</year>
          ).
          <article-title>Social Interaction in Learning Networks</article-title>
          . In R. Koper (Ed.),
          <source>Learning Network Services for Professional Development</source>
          (pp.
          <fpage>13</fpage>
          -
          <lpage>15</lpage>
          ). Berlin, Germany: Springer Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          31.
          <string-name>
            <surname>Tang</surname>
            <given-names>T.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCalla</surname>
            <given-names>G.I.</given-names>
          </string-name>
          , “
          <article-title>Smart Recommendation for an Evolving E-Learning System: Architecture and Experiment”</article-title>
          ,
          <source>International Journal on E-Learning</source>
          ,
          <volume>4</volume>
          (
          <issue>1</issue>
          ),
          <fpage>105</fpage>
          -
          <lpage>129</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          32.
          <string-name>
            <surname>Tiffany</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Tang</surname>
          </string-name>
          , &amp;
          <string-name>
            <surname>Gordon</surname>
            ,
            <given-names>McCalla.</given-names>
          </string-name>
          <article-title>The Pedagogical Value of Papers: a CollaborativeFiltering based Paper Recommender</article-title>
          .
          <source>Journal of Digital Information;</source>
          Vol
          <volume>10</volume>
          , No 2 (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          33.
          <string-name>
            <surname>Vassileva</surname>
            <given-names>J</given-names>
          </string-name>
          . (
          <year>2008</year>
          ).
          <article-title>Toward Social Learning Environments</article-title>
          .
          <source>IEEE Transactions on Learning Technologies</source>
          ,
          <volume>1</volume>
          (
          <issue>4</issue>
          ),
          <fpage>199</fpage>
          -
          <lpage>214</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          34.
          <string-name>
            <surname>Verbert</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drachsler</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manouselis</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolpers</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vuorikari</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
            <given-names>E.</given-names>
          </string-name>
          ,
          <article-title>Datasetdriven research for improving recommender systems for learning</article-title>
          ,
          <source>Proceeding LAK '11, Proceedings of the 1st International Conference on Learning Analytics and Knowledge, Pages</source>
          <volume>44</volume>
          -
          <fpage>53</fpage>
          , ACM New York, NY, USA,
          <year>2011</year>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          35.
          <string-name>
            <surname>Verbert</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manouselis</surname>
            <given-names>N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drachsler</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
            <given-names>E</given-names>
          </string-name>
          .
          <article-title>(to appear) Dataset-driven Research to Support Learning and Knowledge Analytics</article-title>
          .
          <source>Educational Technology &amp; Society, Special Issue on Learning and Knowledge Analytics</source>
          , to appear.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          36.
          <string-name>
            <surname>Wolpers</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Najjar</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verbert</surname>
            <given-names>K.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Duval</surname>
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>Tracking Actual Usage: the Attention Metadata Approach</article-title>
          .
          <source>Educational Technology &amp; Society</source>
          ,
          <volume>10</volume>
          (
          <issue>3</issue>
          ),
          <fpage>106</fpage>
          -
          <lpage>121</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          37.
          <string-name>
            <surname>Ziegler</surname>
            <given-names>C.-N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golbeck</surname>
            <given-names>J</given-names>
          </string-name>
          . (
          <year>2006</year>
          )
          <article-title>Investigating Correlations of Trust and Interest Similarity. Decision Support Services</article-title>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>