<!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>Focussed Crawling of Environmental Web Resources: A Pilot Study on the Combination of Multimedia Evidence</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Theodora Tsikrika</string-name>
          <email>theodora.tsikrika@iti.gr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anastasia Moumtzidou</string-name>
          <email>moumtzid@iti.gr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ioannis Kompatsiaris</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Algorithms</institution>
          ,
          <addr-line>Performance, Design, Experimentation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Copyright c by the paper's authors. Copying permitted only for private and academic purposes. In: S. Vrochidis, K. Karatzas, A. Karpinnen, A. Joly (eds.): Proceedings of the International Workshop on Environmental Multimedia Retrieval (EMR 2014)</institution>
          ,
          <addr-line>Glasgow</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Information Technologies Institute Centre for Research and Technology Hellas Thessaloniki</institution>
          ,
          <country country="GR">Greece</country>
        </aff>
      </contrib-group>
      <fpage>61</fpage>
      <lpage>68</lpage>
      <abstract>
        <p>This work investigates the use of focussed crawling techniques for the discovery of environmental multimedia Web resources that provide air quality measurements and forecasts. Focussed crawlers automatically navigate the hyperlinked structure of the Web and select the hyperlinks to follow by estimating their relevance to a given topic, based on evidence obtained from the already downloaded pages. Given that air quality measurements and particularly air quality forecasts are presented not only in textual form, but are most commonly encoded as multimedia, mainly in the form of heatmaps, we propose the combination of textual and visual evidence for predicting the bene t of fetching an unvisited Web resource. First, text classi cation is applied to select the relevant hyperlinks based on their anchor text, a surrounding text window, and URL terms. Further hyperlinks are selected by combining their text classi cation score with an image classi cation score that indicates the presence of heatmaps in their source page. A pilot evaluation indicates that the combination of textual and visual evidence results in improvements in the crawling precision over the use of textual features alone.</p>
      </abstract>
      <kwd-group>
        <kwd>focussed crawling</kwd>
        <kwd>environmental data</kwd>
        <kwd>link context</kwd>
        <kwd>image classi cation</kwd>
        <kwd>heatmaps</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Categories and Subject Descriptors</title>
      <p>H.3 [Information Systems]: Information Storage and
Retrieval</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>Environmental conditions, such as the weather, air
quality, and pollen concentration, are considered as one of the
factors with a strong impact on the quality of life, since they
directly a ect human health (e.g., allergies and asthma), a
variety of human outdoor activities (ranging from
agriculture to sports and travel planning), as well as major
environmental issues (such as the greenhouse e ect). In
order to support both scientists in forecasting
environmental phenomena and also people in everyday action planning,
there is a need for services that provide access to
information related to environmental conditions that is gathered
from several sources, with a view to obtaining reliable data.
Monitoring stations established by environmental
organisations and agencies typically perform such measurements
and make them available, most commonly, through Web
resources, such as pages, sites, and portals. Assembling and
integrating information from several such providers is a
major challenge, which requires, as a rst step, the automatic
discovery of Web resources that contain environmental
measurement data; this can be cast as a domain{speci c search
problem.</p>
      <p>
        Domain{speci c search is mainly addressed by techniques
that fall into two categories: (i) the domain{speci c query
submission to a general{purpose search engine followed by
post{retrieval ltering, and (ii) focussed crawling. Past
research in the environmental domain (e.g., [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) has mainly
applied techniques from the rst category, while the e
ectiveness of focussed crawlers for environmental Web resources
has not been previouly investigated.
      </p>
      <p>
        Focussed (or topical ) crawlers exploit the graph structure
of the Web for the discovery of resources about a given topic.
Starting from one or more seed URLs on the topic, they
download the Web pages addressed by them and mine their
content so as to extract the hyperlinks contained therein and
select the ones that would lead them to pages relevant to the
topic. This process is iteratively repeated until a su cient
number of pages is fetched (i.e., downloaded). To predict
the bene t of fetching an unvisited Web resource is a
major challenge since crawlers need to estimate its relevance to
the topic at hand based solely on evidence obtained from
the already downloaded pages. To this end, state{of{the{
art approaches (see [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] for a review) adopt classi er{guided
crawling strategies based on supervised machine learning;
the hyperlinks are classi ed based on their local context,
such as their anchor text and the textual content
surrounding them in the parent page from which they were extracted,
as well on global evidence associated with the entire parent
page, such as its textual content or its hyperlink structure.
      </p>
      <p>
        This work investigates focussed crawling for the
automatic discovery of environmental Web resources, in
particular those providing air quality measurements and
forecasts; see Figure 1 for some characteristic examples. Such
resources report the concentration values of several air
pollutants, such as sulphur dioxide (SO2), nitrogen oxides and
dioxide (NO+NO2), thoracic particles (PM10), ne
particles (PM2.5) and ozone (O3), measured or forecact for
speci c regions [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Empirical studies [
        <xref ref-type="bibr" rid="ref11 ref17 ref8">8, 17, 11</xref>
        ] have revealed
that such measurements and particularly air quality
forecasts are presented not only in textual form, but are most
commonly encoded as multimedia, mainly in the form of
heatmaps (i.e., graphical representations of matrix data with
colors representing pollutant concentrations over
geographically bounded regions); see Figure 2 for an example.
      </p>
      <p>This motivates us to form the hypothesis that the
presence of a heatmap in a page already estimated to be an air
quality resource indicates that it is indeed highly relevant
to the topic. Therefore, if such a page has already been
downloaded by a crawler focussed on air quality, it would
be a useful source of global evidence for the selections to be
subsequently performed by such a focussed crawler. To this
end, this work proposes a classi er{guided focussed
crawling approach that estimates the relevance of a hyperlink to
an unvisited Web resource based on the combination of (i)
textual evidence from its local context and (ii) global visual
evidence indicating the presence of a heatmap in its parent
page. This is achieved by the late fusion of text and image
classi cation con dence scores obtained by supervised
machine learning methods based on Support Vector Machines
(SVMs).</p>
      <p>
        The main contribution of this work is a novel focussed
crawling approach that takes into account multimedia
(textual + visual) evidence for predicting the bene t of fetching
an unvisited Web resource based on the combination of text
and image classi ers. State{of{the{art classi er{guided
focussed crawlers rely mainly on textual evidence [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and, to
the best of our knowledge, visual evidence has not been
previously considered in this context. The proposed classi er{
guided focussed crawler is evaluated in the domain of air
quality environmental Web resources and the experimental
results of our pilot study indicate improvements in the
crawling precision when incorporating visual evidence, over the
use of textual features alone.
      </p>
      <p>The remainder of this paper is structured as follows.
Section 2 discusses related work. Section 3 presents the
proposed focussed crawling approach, Section 4 describes the
evaluation setup, and Section 5 reports and analyses the
experimental results. Section 6 concludes this work and
outlines future research directions.
2.</p>
    </sec>
    <sec id="sec-3">
      <title>RELATED WORK</title>
      <p>
        Focussed crawling techniques have been researched since
the early days of the Web [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Based on the `topical locality'
observation that most Web pages link to other pages that
are similar in content [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], focussed crawlers attempt to
estimate the bene t of following a hyperlink extracted from an
already downloaded page by mainly exploiting the (i) local
context of the hyperlink and (ii) global evidence associated
with its parent page.
      </p>
      <p>
        Previous research has de ned local context in textual terms
as the lexical content that appears around a given hyperlink
in its parent page. It may correspond to the anchor text of
the hyperlink, a text window surrounding it, the words
appearing in its URL, and combinations thereof. Virtually all
focussed crawlers [
        <xref ref-type="bibr" rid="ref1 ref13 ref15 ref16 ref19 ref20 ref7">7, 1, 20, 19, 15, 16, 13</xref>
        ] use such textual
evidence in one form or another. Global evidence, on the
other hand, corresponds either to textual evidence, typically
the lexical content of the parent page [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], or to hyperlink
evidence, such as the centrality of the parent page within
its neighbouring subgraph [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. A systematic study of the
e ectiveness of various de nitions of link context has found
that crawling techniques that exploit terms both in the
immediate vicinity of a hyperlink, as well as in its entire parent
page, perform signi cantly better than those depending on
just one of those cues [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        Earlier focussed crawlers (e.g., [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) estimated the relevance
of the hyperlinks pointing to unvisited pages by
computing the textual similarity of the hyperlinks' local context
to a query corresponding to a textual representation of the
topic at hand; this relevance score could also be smoothed
by the textual similarity of the parent page to the same
query. State{of{the{art focussed crawlers, though, use
supervised machine learning methods to decide whether a
hyperlink is likely to lead to a Web page on the topic or
not [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Classi er{guided focussed crawlers, introduced by
Chakrabarti et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], rely on models typically trained using
the content of Web pages relevant to the topic; positive
samples are usually obtained from existing topic directories such
as the Open Directory Project1 (ODP). A systematic
evaluation on the relative merits of various classi cation schemes
has shown that SVMs and Neural Network{based classi ers
perform equally well in a focussed crawling application, with
the former being more e cient, while Naive Bayes is a weak
choice in this context [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. This makes SVMs the classi
cation scheme of choice in guiding focussed crawlers.
      </p>
      <p>
        Focussed crawling has not really been previously explored
in the environmental domain. The discovery of
environmental Web resources has previously been addressed mainly
through the submission of domain{speci c queries to general{
purpose search engines, followed by the application of a
post{retrieval classi cation step for improving precision [
        <xref ref-type="bibr" rid="ref10 ref12">12,
10</xref>
        ]. The queries were generated using empirical information,
including the incorporation of geographical terms [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and
were expanded using `keyword spices' [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], i.e., a Boolean
expression of domain{speci c terms corresponding to the
output of a decision tree trained on an appropriate
corpus [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Post{retrieval classi cation was performed using
SVMs trained on textual features extracted from a training
corpus [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Such approaches are complementary to the
discovery of Web resources using focussed classi ers and hybrid
approaches that combine the two techniques in a common
framework are a promising research direction [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>MULTIMEDIA FOCUSSED CRAWLING</title>
      <p>This work proposes a classi er{guided focussed crawling
approach for the discovery of environmental Web resources
providing air quality measurements and forecasts. To this
end, it estimates the relevance of a hyperlink to an
unvisited resource based on the combination of its local context
with global evidence associated with its parent page.
Local context refers to the textual content appearing in the
vicinity of the hyperlink in the parent page. Motivated by
the frequent occurrence of heatmaps in such Web resources,
we consider the presence of a heatmap in a parent page as
global evidence for its high relevance to the topic.</p>
      <p>An overview of the proposed focussed crawling approach
is depicted in Figure 3. First the seed pages are added to
the list of URLs to fetch. In each iteration, a URL is picked
from the list and the page corresponding to this URL is
fetched (i.e., downloaded) and parsed to extract its
hyperlinks. In the simple case that the focussed crawler estimates
the relevance of a hyperlink pointing to an unvisited page p
based only on its local context, the decision to fetch p
depends solely on the output of an appropriately trained text
classi er. Therefore, a page is fetched if the con dence score
s of the text{based classi er is above an experimentally set
threshold t1.</p>
      <p>However, there are cases in which the local context is not
su cient to e ectively represent relevant hyperlinks, leading
them to obtain low con dence scores below the set threshold
t1, and thus to not being fetched by the focussed crawler.
In this case, global evidence can be used for adjusting the
estimate for the hyperlink's relevance. This is motivated by
the `topical locality' phenomenon of Web pages linking to
other pages that are similar in content; therefore, if there
is strong evidence of the parent's page relevance, then the
relevance estimates of its children pages should be adjusted
accordingly.</p>
      <p>As mentioned before, the presence of heatmaps in a Web
resource already assumed to be an air quality resource is
a strong indication that it is indeed highly relevant to the
topic. Therefore, we propose the consideration of heatmap
presence in the parent page as global evidence to be used
for adjusting the relevance estimate of hyperlinks with
textbased con dence scores below the required threshold t1 (in
practice, a lower bound threshold t2 is also set; this
threshold is also experimentally tuned). In particular, the
estimate of relevance of each hyperlink is adjusted to
correspond to the late fusion of a text and a heatmap
classier: score = f (text classif ier; heatmap classif ier), and
the page is fetched if its score t1. In our case, a binary
heatmap classi er is considered and the fusion function f
is set to correspond to max. This results in a page being
fetched if either its text-based con dence score is above t1 or
if its text-based con dence score is above t2 (t2 &lt; t1) and its
parent page contains at least one heatmap. Next, the text
and heatmap classi ers employed in this work are described.
3.1</p>
    </sec>
    <sec id="sec-5">
      <title>Text–Based Link Classification</title>
      <p>
        Text{based link classi cation is performed using a
supervised machine learning approach based on SVMs and a
variety of textual features extracted from the hyperlink's local
context. SVMs are applied due to their demonstrated e
ectiveness in similar applications [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>Each hyperlink is represented using textual features
extracted from the following elds:
a: anchor text of the hyperlink,
h: the terms extracted from the URL of the hyperlink;
string sequences are split in punctuation marks and
common URL extensions (e.g., com) and pre xes (e.g.,
www) are removed;
s: the terms extracted from a text window of 50
characters surrounding the hyperlink; this text window
does not contain the anchor text of adjacent links (i.e.,
the window stops as soon as it encounters another
link),
so: the terms extracted from a text window of 50
characters surrounding the hyperlink when overlap to the
adjacent links is allowed.</p>
      <p>Combinations of the above lead to the following ve
representations corresponding to concatenations of the respective
elds: a+s, a+so, a+h, a+h+s, and a+h+so.</p>
      <p>In the training phase, a list of positive and negative
samples are collected rst, so as to build a vocabulary for
representing the samples in the textual feature space and also
for training the model. Each sample corresponds to a
hyperlink pointing to a Web page on air quality measurements
and forecasts and its associated a+so representation. The
vocabulary is built by accumulating all the terms from the
a+so representations of the samples and eliminating all
stopwords. This representation was selected so as to lead to a
richer feature space, compared to the sparser a, s, and a+s
representations, while also remaining relatively noise free
compared to the a+h+s and a+h+so representations which
are likely to contain more noise given the di culties in
successfully parsing URLs.</p>
      <p>
        Each sample is represented in the textual feature space
spanned by the created vocabulary using a tf:idf = tf (t; d)
n
log( df(t) ) weighting scheme, where tf (t; d) is the frequency
of term t in sample d and idf (t) is the inverse document
frequency of term t in the collection of n samples, where
df (t) is the number of samples containing that term.
Furthermore, a feature representing the number of geographical
terms in the sample's a+so representation is added, given
the importance of such terms in the environmental domain
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. To avoid overestimation of their e ect, such
geographical terms were previously removed from the vocabulary that
was built. The SVM classi er is built using an RBF kernel
and 5{fold cross{validation is performed on the training set
to select the class weight parameters.
      </p>
      <p>In the testing phase, each sample is represented as a
feature vector based on the tf:idf of the terms extracted from
one of the proposed representation schemes (a, a+s, a+so,
a+h, a+h+s, or a+h+so) and the number of geographical
terms within the same representation. The text{based
classi cation score of each hyperlink is then obatined by the
employing the classi er on the feature vector and corresponds
to a con dence value that re ects the distance of the testing
sample to the hyperplane.</p>
      <p>Our model was trained using 711 samples (100 positive,
611 negative). Each sample corresponds to a hyperlink
pointing to page providing air quality measurements and
forecasts; these hyperlinks were extracted from 26 pages about
air quality obtained from ODP and previous empirical
studies conducted by domain experts in the context of the project
PESCaDO2. It should be noted that both the hyperlinks
and their parent pages are di erent from the seed set used
in the evaluation of the focussed crawler (see Section 4).
The generated lexicon consists of 207 terms with the
following being the 10 most frequent in the training corpus: days,
ozone, air, data, quality, today, forecast, yesterday, raw, and
current. The geographical lexicon consists of 3,625 terms
obtained from a geographical database.
3.2</p>
    </sec>
    <sec id="sec-6">
      <title>Heatmap Recognition</title>
      <p>
        Heatmap recognition is performed by applying a recently
developed approach by our research group [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. That
investigation on heatmap binary classi cation using SVMs and a
variety of visual features indicated that, overall, the MPEG{
7 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] descriptors demonstrated a slightly better performance
than the other tested visual features (SIFT [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and AHDH3
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]).
      </p>
      <p>In particular, the following three extracted MPEG{7
features that capture color and texture aspects of human
perception were the most e ective:</p>
      <p>Scalable Color Descriptor (SC): a Haar{transform
based encoding scheme that measures color
distribution over an entire image, quantized uniformly to 256
bins,
Edge Histogram Descriptor (EH): a scale
invariant visual texture descriptor that captures the spatial
distribution of edges; it involves division of image into
16 non{overlapping blocks and edge information
calculated for each block in ve edge categories, and
Homogenous Texture Descriptor (HT):
describing directionality, coarseness, and regularity of
patterns in images based on a lter bank approach that
employs scale and orientation sensitive lters.</p>
      <p>Their early fusion (SC{EH{HT), as well as the feature EH on
its own produced the best results when employing an SVM
classi er with an RBF kernel. The evaluation was performed
by training the classi er on a dataset of 2,200 images (600
relevant, i.e., heatmaps) and testing it on dataset of 2,860
images (1,170 heatmaps)4.</p>
      <p>In this work, both the EH and the SC{EH{HT models
trained on the rst dataset are employed. An image is
classi ed as a heatmap if at least one of these classi ers considers
it to be a heatmap, i.e., a late fusion approach based on a
logical OR is applied.
2Personalised Environmental Service Con guration and
Delivery Orchestration (http://www.pescado-project.eu/).
3Adaptive Hierarchical Density Histogram.
4Both datasets are available at: http://mklab.iti.gr/
project/heatmaps.</p>
    </sec>
    <sec id="sec-7">
      <title>EVALUATION</title>
      <p>A pilot study is performed for evaluating the performance
of the proposed focussed crawling approach.</p>
      <p>A set of 10 seeds5 (listed in Table 1) was selected,
similarly to before, i.e., using ODP and the outcomes of
empirical studies conducted by domain experts in the context
of the project PESCaDO. Half of them contain at least one
heatmap. Starting from these 10 seeds, a crawl at depth 1
is performed. A total of 807 hyperlinks are extracted from
these 10 seeds and several focussed crawling approaches are
applied for deciding which ones to fetch. These are evaluated
in the following two sets of experiments.
4.1</p>
    </sec>
    <sec id="sec-8">
      <title>Experiments</title>
      <p>Experiment 1: This experiment examines the relative
merits of the di erent text{based representations of
hyperlinks (i.e., a, a+s, a+so, a+h, a+h+s, and a+h+so). In
this case, a text{based classi er{guided focussed crawling
is applied for each representation and a page is fetched if
its text{based con dence score is above a threshold t1.
Experiments are performed for t1 values ranging from 0:0 to
0:9 at step 0:1. When t1 = 0:0, the crawl corresponds to a
breadth{ rst search where all hyperlinks are fetched and no
focussed crawling is performed.</p>
      <p>Experiment 2: This experiment investigates the e
ectiveness of incorporating multimedia evidence in the form
of heatmaps in the crawling process. In this case, a page
pointed by a hyperlink is fetched if the hyperlink's text{
based con dence score is above t1 or if its text{based con
dence score is above t2 (t2 &lt; t1) and its parent page contains
at least one heatmap. The text{based con dence scores are
obtained from the best performing classi er in Experiment
1. Experiments are performed for t1 and t2 values ranging
from 0:0 to 0:9 at step 0:1, while maintaining t2 &lt; t1. These
experimental results are compared against two baselines: (i)
the results of the corresponding text{based focussed crawler
for threshold t1, and (ii) the results of the corresponding
text{based focussed crawler for threshold t2.</p>
      <p>To determine the presence of a heatmap in the parent page
of a hyperlink, the page is parsed (since it is already
downloaded) and the hyperlinks pointing to images are compiled
into a list. The crawler iteratively downloads each image in
the list, extracts its visual features, and applies the heatmap
classi cation until a heatmap is recognised or a maximum
number of images is downloaded from each page (set to 20
in our experiments).</p>
      <p>In both experiments, when a hyperlink appears more than
once within a seed page, only the one with the highest score
is taken into consideration for evaluation purposes.
5These URLs are di erent to the ones used when training
the classi ers.</p>
    </sec>
    <sec id="sec-9">
      <title>Performance Metrics</title>
      <p>
        The standard retrieval evaluation metrics of precision and
recall are typically applied for assessing the e ectiveness of
a focussed crawler. Precision corresponds to the proportion
of fetched pages that are relevant and recall to the
proportion of all relevant pages that are fetched. The latter
requires knowledge of all relevant pages on a given topic, an
impossible task in the context of the Web. To address this
limitation, two recall{oriented evaluation techniques have
been proposed [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]: (i) manually designate a few
representative pages on the topic and measure what fraction of them
are discovered by the crawler, and (ii) measure the overlap
among independent crawls initiated from di erent seeds to
see whether they converge on the same set of pages. Given
the small scope of our study (i.e., a crawl at depth 1), these
approaches are not applicable and therefore recall is not
considered in our evaluation. In addition to precision, the
accuracy of the classi cation of the crawled outlinks is also
reported.
4.3
      </p>
    </sec>
    <sec id="sec-10">
      <title>Relevance Assessments</title>
      <p>All 807 extracted hyperlinks were manually assessed.
After applying some light URL normalisation (e.g., deleting
trailing slashes) and removing duplicates, 689 unique URLs
remain. These correspond both to internal (within{site)
and to external links that were assessed using the
following three{point relevance scale:
(highly) relevant : Web resources that provide air
quality measurements and forecasts. These data should
either be visible on the page or should appear after
selecting a particular value from options (e.g., region,
pollutant, time of day, etc.) provided from drop{down
menus.
partially relevant : Web resources that are about air
quality measurements and forecasts, but do not
provide actual data. Examples include Web resources
that list monitoring sites and the pollutants being
measured, explain what such measurements mean, describe
methods, approaches, and research for measuring,
validating, and forecasting air quality data, or provide
links to components, systems, and applications that
measure air quality.
non{relevant : Web resources that are not relevant to
air quality measurements and forecasts, including
resources that are about air quality and pollution in
general, discussing, for instance, its causes and e ects.
Overall, our crawled dataset contains 232 (33.7%) highly
relevant pages, 51 (7.4%) partially relevant, and 406 (58.9%)
non{relevant ones.
n
o
i
isce .03
r
p</p>
      <p>A closer inspection revealed that 162 (69.8%) of the highly
relevant pages were all crawled from seed no. 2 in Table 1
(http://airnow.gov/). These correspond to internal links
pointing to pages with air quality measurements/forecasts,
each regarding a di erent U.S. region. This, in conjunction
with the fact that all these links obtained really high scores
(over 0:9) by our text classi er led us to remove them from
further consideration as they would signi cantly skew the
evaluation results. Therefore, the evaluation was performed
only for the pages crawled from the nine remaining seeds
and these are the results reported in Section 56. Starting
from the 9 seeds, our crawled dataset contains 526 URLs: 70
(13.3%) highly relevant pages, 50 (9.5%) partially relevant,
and 406 (77.2%) non{relevant ones.</p>
      <p>To apply the performance metrics presented above, these
multiple grade relevance assessments are mapped into binary
relevance judgements in two di erent ways, depending on
whether we are strictly interested in discovering resources
containing air quality data, or whether we would also be
interested in information about air quality measurements
and forecasts. In particular, two mappings are considered:
strict : when considering only highly relevant Web
resources as relevant and the rest (partially relevant and
non{relevant) as non{relevant, and
6It should be noted that http://airnow.gov/ appears in
the list of our crawled pages even when removed from the
seed list, since it is linked from other seed pages. However,
since crawling is performed at depth 1, its own outlinks are
not considered any further.
lenient : when considering both highly relevant and
partially relevant Web resources as relevant.</p>
      <p>The distributions of relevance assessments in these two cases
are listed in Table 2.</p>
    </sec>
    <sec id="sec-11">
      <title>4.4 Implementation</title>
      <p>
        Our implementation is based on Apache Nutch (http://
nutch.apache.org/), a highly extensible and scalable open
source Web crawler software project. To convert it to a
focussed crawler, its parser was modi ed so as to lter the links
being fetched based on our proposed approach. The text{
based classi er was implemented using the libraries of the
Weka machine learning software (http://www.cs.waikato.
ac.nz/ml/weka/), while the implementation of the visual
classi er was based on the LIBSVM [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] library.
      </p>
    </sec>
    <sec id="sec-12">
      <title>RESULTS</title>
      <p>Experiment 1: The results of this rst experiment that
evaluates the e ectiveness of the di erent textual
represen0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Text{based baseline a+s</p>
      <p>(fetch if s &gt;= t2)
tations employed by the text{based focussed crawler are
depicted in Figures 4 and 5, when applying strict and lenient
relevance assessments, respectively.</p>
      <p>The a+s classi er{guided focussed crawler achieves the
highest overall precision, both for the strict and the lenient
cases, and for t1 = 0:4, indicating the bene ts of
combining the anchor text with the terms obtained from a non{
overlapping text window. It also achieves the highest
accuracy, which is equal to that of the a+h and a+h+s
classiers; these two classi ers have though slightly lower
precision compared to that of a+s. This indicates that the URL is
potentially a useful source of evidence and that application
of more advanced techniques for extracting terms from an
URL is probably required for reaching its full potential. The
a+so and a+h+so classi ers are the least e ective for lower
t1 values indicating that the additional terms present in the
overlapping text window introduce noise that leads to the
misclassi cation of non{relevant hyperlinks. Furthermore,
all focussed crawlers improve upon precision for t1 = 0:0
that corresponds to general{purpose crawling. As expected,
the absolute values of precision are much higher in the
lenient case, compared to the strict.</p>
      <p>Experiment 2: The second experiment aims to allow us
to gain insights into the feasibility and potential bene ts of
incorporating multimedia in the form of heatmaps in the
crawling process. To this end, it combines a+s, the best
performing text{based classi er from the rst experiment,
with results from the heatmap classi er. First, the results
of the heatmap classi cation are presented.</p>
      <p>Each of the nine seeds contains 15 images on average as
identi ed by our parser. On average, 8 images are
downloaded from each seed before a heatmap is found or the
image list ends. Out of the 75 downloaded images, 74 were
correctly classi ed, with 3 being heatmaps. This means
that 8 of the 9 seeds were classi ed accurately for the
presence of heatmaps in them (all apart from seed no. 10 in
Table 1). This is probably due to the di culty in parsing
the speci c Web resource and also in recognising its images
as heatmaps, as they correspond to non{typical heatmaps,
di erent to the ones in our training set. On average, 10
seconds were required per Web resource for the downloading,
feature extraction, and classi cation of its images; however,
this overhead could be reduced by applying parallelisation.</p>
      <p>Tables 3 and 4 present the results of the second
experiment, when applying strict and lenient relevance
assessments, respectively, for t1 and t2 values ranging from 0:0
to 0:9 at step 0:1, while maintaining t2 &lt; t1. The results
are compared against the two baselines listed in the tables'
last column and last row respectively. The values in bold
correspond to improvements over both baselines.</p>
      <p>The observed substantial improvements for multiple
threshold values provide an indication of the bene ts of
incorporating visual evidence as global evidence in a focussed crawler.
Consider the best performing classi er when strict relevance
assessments are employed: it achieves precision of 0:44 for
t1 = 0:9 and t2 = 0:3, while the text{based focussed crawler
for the same t1 = 0:9 achieves precision 0:30. An
examination of the results shows that the improvements are due to
the fact that 65% of the newly added hyperlinks, i.e., those
with text{based classi cation score between 0:3 and 0:9, are
relevant.</p>
    </sec>
    <sec id="sec-13">
      <title>CONCLUSIONS</title>
      <p>This work proposed a novel classi er{guided focussed
crawling approach for the discovery of environmental Web
resources providing air quality measurements and forecasts
that combines multimedia (textual + visual) evidence for
predicting the bene t of fetching an unvisited Web resource.
The results of our pilot study provide a rst indication of the
e ectiveness of incorporating visual evidence in the focussed
crawling process over the use of textual features alone.</p>
      <p>
        Large{scale experiments are currently planned for fully
assessing the potential bene ts of the proposed
multimedia focussed crawling approach, including experiments for
improving the e ectiveness of the textual classi cation by
taking into account also the textual content of the entire
parent page, similar to previous research [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Further
future work includes the consideration of other types of images
common in environmental Web resources, such as diagrams,
simple ltering mechanisms for removing prior to classi
cation small{size images that are unlikely to contain useful
information (e.g., logos and layout elements), and the
incorporation of additional local evidence, such as the distance
of the hyperlink to the heatmap image. Finally, we aim to
investigate the application of the proposed focussed crawler
in other domains where information is commonly encoded
in multimedia form, such as food recipes.
      </p>
    </sec>
    <sec id="sec-14">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work was supported by MULTISENSOR (contract
no. FP7{610411) and HOMER (contract no. FP7{312388)
projects, partially funded by the European Commission.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chakrabarti</surname>
          </string-name>
          , M. van den Berg, and
          <string-name>
            <given-names>B.</given-names>
            <surname>Dom</surname>
          </string-name>
          .
          <article-title>Focused crawling: A new approach to topic-speci c web resource discovery</article-title>
          .
          <source>In Proceedings of the 8th International Conference on World Wide Web, (WWW</source>
          <year>1999</year>
          ), pages
          <fpage>1623</fpage>
          {
          <fpage>1640</fpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Chang</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>LIBSVM: a library for support vector machines</article-title>
          .
          <source>ACM Transactions on Intelligent Systems and Technology (TIST)</source>
          ,
          <volume>2</volume>
          (
          <issue>3</issue>
          ):
          <fpage>27</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S. F.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sikora</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Puri</surname>
          </string-name>
          .
          <article-title>Overview of the MPEG-7 standard</article-title>
          .
          <source>IEEE Transactions on Circuits and Systems for Video Technology</source>
          ,
          <volume>11</volume>
          (
          <issue>6</issue>
          ):
          <volume>688</volume>
          {
          <fpage>695</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Chat eld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. S.</given-names>
            <surname>Lempitsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vedaldi</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          .
          <article-title>The devil is in the details: an evaluation of recent feature encoding methods</article-title>
          .
          <source>In Proceedings of the British Machine Vision Conference (BMVC</source>
          <year>2011</year>
          ), pages
          <fpage>1</fpage>
          {
          <fpage>12</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Garcia-Molina</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Page</surname>
          </string-name>
          .
          <article-title>E cient crawling through URL ordering</article-title>
          .
          <source>Computer Networks</source>
          ,
          <volume>30</volume>
          (
          <issue>1-7</issue>
          ):
          <volume>161</volume>
          {
          <fpage>172</fpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Davison</surname>
          </string-name>
          .
          <article-title>Topical locality in the web</article-title>
          .
          <source>In Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <source>(SIGIR</source>
          <year>2000</year>
          ), pages
          <fpage>272</fpage>
          {
          <fpage>279</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>De Bra and R. D. J. Post</surname>
          </string-name>
          .
          <article-title>Information retrieval in the world-wide web: Making client-based searching feasible</article-title>
          .
          <source>Computer Networks and ISDN Systems</source>
          ,
          <volume>27</volume>
          (
          <issue>2</issue>
          ):
          <volume>183</volume>
          {
          <fpage>192</fpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Epitropou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Karatzas</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Bassoukos</surname>
          </string-name>
          .
          <article-title>A method for the inverse reconstruction of environmental data applicable at the chemical weather portal</article-title>
          .
          <source>In Proceedings of the GI-Forum Symposium and Exhibit on Applied Geoinformatics</source>
          , pages
          <volume>58</volume>
          {
          <fpage>68</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>K.</given-names>
            <surname>Karatzas</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Moussiopoulos</surname>
          </string-name>
          .
          <article-title>Urban air quality management and information systems in Europe: legal framework and information access</article-title>
          .
          <source>Journal of Environmental Assessment Policy and Management</source>
          ,
          <volume>2</volume>
          (
          <issue>02</issue>
          ):
          <volume>263</volume>
          {
          <fpage>272</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Moumtzidou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vrochidis</surname>
          </string-name>
          , E. Chatzilari,
          <string-name>
            <surname>and I. Kompatsiaris.</surname>
          </string-name>
          <article-title>Discovery of environmental nodes based on heatmap recognition</article-title>
          .
          <source>In Proceedings of the 20th IEEE International Conference on Image Processing (ICIP</source>
          <year>2013</year>
          ),
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Moumtzidou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vrochidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Kompatsiaris</surname>
          </string-name>
          .
          <article-title>Discovery, analysis and retrieval of multimodal environmental information</article-title>
          .
          <source>In Encyclopedia of Information Science and Technology (in press)</source>
          .
          <source>IGI Global</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Moumtzidou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vrochidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tonelli</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kompatsiaris</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Pianta</surname>
          </string-name>
          .
          <article-title>Discovery of environmental nodes in the web</article-title>
          .
          <source>In Multidisciplinary Information Retrieval, Proceedings of the 5th International Retrieval Facility Conference (IRFC</source>
          <year>2012</year>
          ), volume
          <volume>7356</volume>
          <source>of LNCS</source>
          , pages
          <volume>58</volume>
          {
          <fpage>72</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Olston</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Najork</surname>
          </string-name>
          .
          <article-title>Web crawling</article-title>
          .
          <source>Foundations and Trends in Information Retrieval</source>
          ,
          <volume>4</volume>
          (
          <issue>3</issue>
          ):
          <volume>175</volume>
          {
          <fpage>246</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Oyama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kokubo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Ishida</surname>
          </string-name>
          .
          <article-title>Domain-speci c web search with keyword spices</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>16</volume>
          (
          <issue>1</issue>
          ):
          <volume>17</volume>
          {
          <fpage>27</fpage>
          ,
          <string-name>
            <surname>Jan</surname>
          </string-name>
          .
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G.</given-names>
            <surname>Pant</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Srinivasan</surname>
          </string-name>
          .
          <article-title>Learning to crawl: Comparing classi cation schemes</article-title>
          .
          <source>ACM Transactions on Information Systems</source>
          ,
          <volume>23</volume>
          (
          <issue>4</issue>
          ):
          <volume>430</volume>
          {
          <fpage>462</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>G.</given-names>
            <surname>Pant</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Srinivasan</surname>
          </string-name>
          .
          <article-title>Link contexts in classi er-guided topical crawlers</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>18</volume>
          (
          <issue>1</issue>
          ):
          <volume>107</volume>
          {
          <fpage>122</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17] R. San Jose, A. Baklanov,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sokhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Karatzas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Perez</surname>
          </string-name>
          .
          <article-title>Computational air quality modelling</article-title>
          .
          <source>Developments in Integrated Environmental Assessment</source>
          ,
          <volume>3</volume>
          :
          <fpage>247</fpage>
          {
          <fpage>267</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>P.</given-names>
            <surname>Sidiropoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vrochidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Kompatsiaris</surname>
          </string-name>
          .
          <article-title>Content-based binary image retrieval using the adaptive hierarchical density histogram</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>44</volume>
          (
          <issue>4</issue>
          ):
          <volume>739</volume>
          {
          <fpage>750</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T. T.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          , and
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Gri ths. Focused crawling for both topical relevance and quality of medical information</article-title>
          .
          <source>In Proceedings of the 14th ACM International Conference on Information and Knowledge Management</source>
          ,
          <source>(CIKM</source>
          <year>2005</year>
          ), pages
          <fpage>147</fpage>
          {
          <fpage>154</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T. T.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R. S.</given-names>
            <surname>Sankaranarayana</surname>
          </string-name>
          .
          <article-title>Focused crawling in depression portal search: A feasibility study</article-title>
          .
          <source>In Proceedings of the 9th Australasian Document Computing Symposium (ADCS</source>
          <year>2004</year>
          ), pages
          <fpage>1</fpage>
          <issue>{9</issue>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>