<!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 Particle Swarm Optimizer to Cluster Parallel Spanish-English Short-text Corpora∗</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Diego Ingaramo, Marcelo Errecalde, Leticia Cagnina LIDIC Research Group Universidad Nacional de San Luis Ej. de los Andes 950 5700 San Luis</institution>
          ,
          <country country="AR">Argentina</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Paolo Rosso Natural Language Engineering Lab. ELiRF, DSIC Universidad Polit ́ecnica de Valencia Camino de Vera</institution>
          <addr-line>s/n 46022 Valencia, Espan ̃a</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <fpage>43</fpage>
      <lpage>48</lpage>
      <abstract>
        <p>Short-texts clustering is currently an important research area because of its applicability to web information retrieval, text summarization and text mining. These texts are often available in different languages and parallel multilingual corpora. Some previous works have demonstrated the effectiveness of a discrete Particle Swarm Optimizer algorithm, named CLUDIPSO, for clustering monolingual corpora containing very short documents. In all the considered cases, CLUDIPSO outperformed different algorithms representative of the state-of-the-art in the area. This paper presents a preliminary study showing the performance of CLUDIPSO on parallel Spanish-English corpora. The idea is to analyze how this bilingual information can be incorporated in the CLUDIPSO algorithm and to what extent this information can improve the clustering results. In order to adapt CLUDIPSO to a bilingual environment, some alternatives are proposed and evaluated. The results were compared considering CLUDIPSO in both environments, bilingual and monolingual. The experimental work shows that bilingual information allows to obtain just comparable results to those obtained with monolingual corpora. More work is required to make an effective use of this kind of information.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction</title>
      <p>Vast amounts of information are actually
available on internet in documents such as
news, academic works, web-repositories, etc.
many of which are in a short-text format.
Document clustering groups automatically a
large set of documents into different clusters.
In this context, the clustering of short-text
corpora, is one of the most difficult tasks in
natural language processing due to the low
frequencies of terms in the documents.</p>
      <p>
        In document clustering, the information
about categories and correctly categorized
documents is not provided in advance. An
important consequence of this lack of
information is that in realistic document
clustering problems, results can not usually be
evaluated with typical external measures like F
Measure and Entropy, because the correct
categorizations specified by a human expert
are not available. Therefore, the quality of
the resulting groups is evaluated with
respect to structural properties expressed in
different Internal Clustering Validity
Measures (ICVMs). Classical ICVMs used as
cluster validity measures include the Dunn
and Davies-Bouldin indexes, the Global
Silhouette (GS) coefficient and, new
graphbased measures such as the Expected Density
Measure and the λ-Measure (see
        <xref ref-type="bibr" rid="ref13">(Ingaramo
et al., 2008)</xref>
        for detailed descriptions of these
ICVMs).
      </p>
      <p>
        The use of ICVMs has not been limited
to the cluster evaluation stage. Different
ICVMs have also been used as explicit
objective functions that the clustering algorithm
attempts to optimize during the grouping
process. This approach has been adopted,
for example, in CLUDIPSO, a discrete
Particle Swarm Optimizer (PSO) which obtained
in previous work
        <xref ref-type="bibr" rid="ref11">(Ingaramo et al., 2009)</xref>
        interesting results on small short-text
collections. This algorithm uses the unsupervised
measure GS as objective function to be
optimized.
      </p>
      <p>
        CLUDIPSO, and other techniques to
∗ This work has been done in the framework of the
VLC/CAMPUS Microcluster on Multimodal
Interaction in Intelligent Systems and it has been partially
funded by the European Commission as part of the
WIQEI IRSES project (grant no. 269180) within the
FP 7 Marie Curie People Framework, by MICINN
as part of the Text-Enterprise 2.0 project
        <xref ref-type="bibr" rid="ref10">(TIN200913391-C04-03)</xref>
        within the Plan I+D+i, and by UPV
as part of the PAID-02-10 programme (grant. no.
2257).
cluster short documents (see for example
        <xref ref-type="bibr" rid="ref1 ref10 ref14 ref8">(Alexandrov, Gelbukh, and Rosso, 2005;
Pinto, Bened´ı, and Rosso, 2007; He et al.,
2007; Carullo, Binaghi, and Gallo, ; Hu et
al., 2009)</xref>
        ), have obtained good results with
documents written in the same language, i.e.
monolingual environments. However,
nowadays, there are many linguistics resources
which make available information written in
different languages. These resources include
for example, parallel and aligned parallel
corpora which have been used in different
applications such as extraction of word translation
equivalents
        <xref ref-type="bibr" rid="ref15">(Ribeiro and Lopes, 2000)</xref>
        and
studies of lexical semantics
        <xref ref-type="bibr" rid="ref16">(Sharoff, 2002)</xref>
        ,
among others. However, little effort has been
dedicated to analyze if this multilingual
information could help to improve the results that
classical text analysis methods like text
categorization and clustering obtain on
monolingual corpora.
      </p>
      <p>In this work, information from parallel
Spanish-English corpora is used in short-text
clustering and two main research questions
are addressed: 1) how this bilingual
information can be incorporated in the CLUDIPSO
algorithm, and 2) to what extent this
information can improve the clustering results.
The first aspect is addressed in Section 2.1,
where some modifications are introduced in
CLUDIPSO to incorporate information from
parallel Spanish-English short-text corpora.
The second one is analyzed in Section 3 which
includes results of CLUDIPSO with
Spanish and English documents (taken separately)
and results with approaches that
simultaneously consider documents written in both
languages.</p>
      <p>The remainder of the paper is organized
as follows. Section 2 describes CLUDIPSO,
the PSO-based algorithm under study and
the proposed alternatives to bilingual
document clustering. Section 3 describes some
general features of the corpora used in the
experiments, the experimental setup and the
analysis of the results obtained from the
empirical study. Finally, some general
conclusions are drawn and present and future work
is discussed in Section 4.
2</p>
    </sec>
    <sec id="sec-3">
      <title>The CLUDIPSO Algorithm</title>
      <p>
        CLUDIPSO (CLUstering with a DIscrete
Particle Swarm Optimization), is based on
a PSO
        <xref ref-type="bibr" rid="ref5">(Eberhart and Kennedy, 1995)</xref>
        algorithm that operates on a population of
particles. Each particle, in the basic version of
PSO, is a real numbers vector which
represents a position in the search space defined by
the variables corresponding to the problem to
solve. The best position found so far for the
swarm (gbest ) and the best position reached
by each particle (pbest ) are recorded at each
cycle (iteration of the algorithm). The
particles evolve at each cycle using two updating
formulas, one for velocity (Equation (1)) and
another for position (Equation (2)).
vid = w(vid + γ1(pbid − parid) + γ2(pgd − parid)) (1)
parid = parid + vid
(2)
where parid is the value of the particle i
at the dimension d, vid is the velocity of
particle i at the dimension d, w is the inertia
factor
        <xref ref-type="bibr" rid="ref6">(Eberhart and Shi, 1998)</xref>
        whose goal
is to balance global exploration and local
exploitation, γ1 is the personal learning
factor, and γ2 the social learning factor, both
multiplied by 2 different random numbers
within the range [0, 1]. pbid is the best
position reached by the particle i and pgd is
the best position reached by any particle in
the swarm.
      </p>
      <p>In the discrete version CLUDIPSO, each
valid clustering is represented with a
particle. The particles are n-dimensional integer
vectors, where n is the number of documents
in the corpus. Since the task was modeled
with a discrete approach, a new formula was
developed for updating the positions (shown
in Equation (3)).</p>
      <p>parid = pbid
(3)
where parid is the value of the particle i
at the dimension d and pbid is the best
position reached by the particle i until that
moment. This equation was introduced with
the objective of accelerate the convergence
velocity of the algorithm (principal incoming
of discrete PSO models). It is important to
note that in this approach the process of
updating particles is not as direct as in the
continuous case (basic PSO algorithm). In
CLUDIPSO, the updating process is not
carried out on all dimensions at each iteration.
In order to determine which dimensions
of a particle will be updated the following
steps are performed: 1) all dimensions of the
velocity vector are normalized in the [0, 1]
range, according to the process proposed by</p>
      <p>
        Hu et al.
        <xref ref-type="bibr" rid="ref9">(Hu, Eberhart, and Shi, 2003)</xref>
        for
a discrete PSO version; 2) a random number
r ∈ [0, 1] is calculated; 3) all the dimensions
(in the velocity vector) higher than r are
selected in the position vector, and updated
using the Equation (3).
      </p>
      <p>
        A Dynamic mutation operator
        <xref ref-type="bibr" rid="ref2">(Cagnina,
Esquivel, and Gallard, 2004)</xref>
        is applied
with a pm-probability calculated with the
total number of iterations in the algorithm
(cycles) and the current cycle number: pm =
max pm − max pm−min pm ∗ current cycle.
      </p>
      <p>
        max cycle
Where max pm and min pm are the
maximum and minimum values that pm can take,
max cycle is the total number of cycles and
the current cycle in the iterative process is
current cycle. The mutation operation is
applied if the particle is the same that its
own pbest, as was suggest by
        <xref ref-type="bibr" rid="ref9">(Hu, Eberhart,
and Shi, 2003)</xref>
        . The mutation operator
swaps two random dimensions of the particle
and in that way avoids premature
convergence.
      </p>
      <p>Global Silhouette (GS) Coefficient was
used as an objective function f (pi), because
gives a reasonable estimation of the quality
of the obtained groups. The optimization of
GS drives the entire CLUDIPSO process.
The GS measure combines two key aspects
to determine the quality of a given
clustering: cohesion and separation. Cohesion
measures how closely related are the objects in
a same cluster whereas separation quantifies
how distinct (well-separated) a cluster from
other clusters is. The GS coefficient of a
clustering is the average cluster silhouette of all
the obtained groups. The cluster silhouette
of a cluster C also is an average silhouette
coefficient but, in this case, of all objects
belonging to C. Therefore, the
fundamental component of this measure is the formula
used for determining the silhouette coefficient
of any arbitrary object i, that we will refer as
s(i) and that is defined as follows:
s(i) =</p>
      <p>b(i) − a(i)
max(a(i), b(i))
(4)
with −1 ≤ s(i) ≤ 1. The a(i) value denotes
the average dissimilarity of the object i to
the remaining objects in its own cluster, and
b(i) is the average dissimilarity of the object
i to all objects in the nearest cluster. From
this formula it can be observed that negative
values for this measure are undesirable and
that for this coefficient values as close to 1 as
possible are desirable.
2.1</p>
      <p>
        CLUDIPSO adaptations to
bilingual contexts
The idea of using bilingual information in
a clustering algorithm is motivated by
similar reasons to those giving origin to
ensemble methods
        <xref ref-type="bibr" rid="ref4">(Dietterich, 2000)</xref>
        : the combined
use of information (about the same problem)
coming from different sources, can be more
effective than consider this information
separately. In the context of our work, this
intuitive idea consists in determining how the
information obtained from the alignment of
documents in parallel corpora can be used
by a clustering algorithm instead of
clustering the documents in the different languages
separately.
      </p>
      <p>CLUDIPSO allows to combine this kind of
information in a relatively direct way: using
the values that the evaluation function
obtains with the documents in each language,
and combining these values using different
criteria. For example, the minimum (MIN),
maximum (MAX) or average (AVG) value
between the evaluation function’s values
obtained with the documents in each language
could be used. Or simply taking the value
that the evaluation function returns with
documents in both languages, but alternating
in each iteration the language used to
evaluate this function. More formally:
Let D be a bilingual environment
(parallel corpus) with Spanish-English documents.
Then, each document di ∈ D will be
represented by an English text, diEN and the
corresponding representation of di in
Spanish language, diES . Let DEN and DES be
the documents in D in its English and
Spanish representation respectively.</p>
      <p>We will denote as CLU DIP SOMULT I
the CLUDIPSO version that incorporates
DEN and DES information in the
clustering process. CLU DIP SOMULT I uses the
available bilingual information by adapting
the CLUDIPSO evaluation function step (see
section 2). The four alternatives that were
considered to incorporate the bilingual
information in the evaluation function are
described below.</p>
      <p>Let p be a particle representing a
possible solution (clustering) and let f (pen) and
f (pes) be the fitness values of p with respect
to DEN and DES respectively. Then, the
fitness value for:
1. CLU DIP SOMULT I−MAX is defined as:
f (p) = max(f (pen), f (pes)).
2. CLU DIP SOMULT I−MIN is defined as:
f (p) = min(f (pen), f (pes)).
3. CLU DIP SOMULT I−AV G is defined as:
f (p) = f(pen)+f(pes) .</p>
      <p>2
4. CLU DIP SOMULT I−ALT in the
iteration i is f (pen) if i is odd and f (pes) in
other case.</p>
      <p>Thus, for example, if the Silhouette
Coefficient is used as evaluation function,
CLU DIP SOMULT I−AV G will use as fitness
value the average value obtained from the
Silhouette value for the clustering pi using the
English documents in D and the Silhouette
value for the same clustering, but using in
this case the Spanish documents.
3</p>
    </sec>
    <sec id="sec-4">
      <title>Experimental Setting and</title>
    </sec>
    <sec id="sec-5">
      <title>Analysis of Results</title>
      <p>For the experimental work, two collections
with different levels of complexity with
respect to the size, length of documents and
vocabulary overlapping were selected:
SEPLNCICLing and JRC-Acquis. Table 1 shows some
general features of these corpora: corpus size
(CS), number of categories and documents
(|C| and |D| respectively), total number of
terms in the collection (|T |), vocabulary size
(|V|) and average number of terms per
document (T d).</p>
      <p>
        The first one, SEPLN-CICLing, is a small
collection based on CICLing-20021 scientific
abstract corpus which has been intensively
used in different works
        <xref ref-type="bibr" rid="ref11 ref12 ref12 ref7 ref7">(Ingaramo et al., 2009;
Ingaramo, Errecalde, and Rosso, 2010;
Errecalde, Ingaramo, and Rosso, 2010)</xref>
        . This
corpus was enriched with bilingual abstracts
(in Spanish and English) of the SEPLN2.
      </p>
      <p>The SEPLN-CICLingEN corpus was
composed by the English abstracts of
CICLing2002 and SEPLN. The SEPLN-CICLingES was
obtained adding to the Spanish version of
SEPLN abstracts the manual translation of the
CICLing abstracts.</p>
      <p>1http://www.cicling.org/2002/
2http://www.sepln.org/</p>
      <p>
        JRC-Acquis refers to a sub-collection of the
Acquis
        <xref ref-type="bibr" rid="ref17">(Steinberger et al., 2006)</xref>
        , a popular
multilingual collection with legal documents
and laws corresponding to different countries
of the European Union. For this work, we
selected 563 documents in the English and
Spanish versions, denoted JRC-AcquisEN and
JRC-AcquisES respectively.
      </p>
      <p>Corpora
SEPLN-CICLingEN
SEPLN-CICLingES
JRC-AcquisEN
JRC-AcquisES
Corpora
SEPLN-CICLingEN
SEPLN-CICLingES
JRC-AcquisEN
JRC-AcquisES</p>
      <p>Due to the fact the gold standard is known
for each of the two sub-collections, the quality
of the results was evaluated by using the
classical (external) F -measure. Each algorithm
generated 50 independent runs per collection
after performing 10,000 iterations (stopping
condition). The reported results in Table 2,
correspond to the minimum (Fmin),
maximum (Fmax) and average (Favg ) F -measure
values obtained by the different the
algorithm of CLUDIPSO. The values highlighted
in bold, indicate the best obtained results.
it is observed that the version CLU DIP SO−
EN obtained the best Favg value and
CLU DIP SOMULT I the best Fmax value.
Similar results can be observed with the Fmin
values in both cases. It should be noted
that CLU DIP SOMULT I slightly overcomes
the algorithm CLU DIP SO − ES but not
the CLU DIP SO − EN although both
algorithms have a similar performance no matter
the language used.</p>
      <p>With respect to the obtained results
with the larger collection JRC-Acquis,
CLU DIP SOMULT I gets similar values to
CLU DIP SO−EN and a minimum
improvement compared to CLU DIP SO − ES (like
in SEPLN-CICLing). It should be noted that
CLU DIP SOMULT I improves Fmin in all the
cases, excluding CLU DIP SOMULT I−ALT .
Experiments carried out show an
improvement related to CLU DIP SO − ES but
results are similar to CLU DIP SO − EN .
However, in JRC-Acquis results needs to be
improved for both languages.
4</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions and Future Work</title>
      <p>This work presents a preliminary study
of performance of different versions of
CLU DIP SOMULT I , a novel bilingual
PSObased clustering algorithm. The results
obtained by CLU DIP SOMULT I on
SpanishEnglish corpora indicate that the approach is
an alternative to solve bilingual clustering of
small short-text corpora, although no
significant improvement was obtained so far with
respect to the monolingual PSO-based
version CLUDIPSO. CLU DIP SOMULT I was
also tested with a larger size collection and
the performance was comparable to its
predecessor monolingual CLUDIPSO, possibly the
lack of improvement it is due to the
limitations derived by a wide search space in large
document collection.</p>
      <p>Future works include text-enrichment of
documents, combining both documents
representations by using a term selection
technique and also, including bilingual
information into a novel on going version named
CLU DIP SO⋆ considering newer
mechanisms to incorporate the bilingual knowledge.</p>
      <p>The proposed algorithm was tested
with Spanish-English corpora although other
bilingual corpora could be used in a future.</p>
      <p>In order to tackle the problem of the
size of the particle that CLU DIP SOMULT I
suffers with collection such as JRC-Acquis,
we aim at investigating the possibility of
dividing the particle in two: a part of the
particle would deal with the representation
in English and the other one with the
Spanish representation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Alexandrov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gelbukh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>An approach to clustering abstracts</article-title>
          .
          <source>In Andr´es Montoyo</source>
          , Rafael Mun˜oz, and Elisabeth Metais, editors,
          <source>Natural Language Processing and Information Systems</source>
          , volume
          <volume>3513</volume>
          <source>of LNCS</source>
          . Springer Berlin / Heidelberg, pages
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Cagnina</surname>
            , L.,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Esquivel</surname>
            , and
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Gallard</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Particle swarm optimization for sequencing problems: a case study</article-title>
          .
          <source>In Congress on Evolutionary Computation</source>
          , pages
          <fpage>536</fpage>
          -
          <lpage>541</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Carullo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Binaghi</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Gallo.</surname>
          </string-name>
          <article-title>An online document clustering technique for short web contents</article-title>
          .
          <source>Pattern Recognition Letters</source>
          ,
          <volume>30</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Dietterich</surname>
            ,
            <given-names>T. G.</given-names>
          </string-name>
          <year>2000</year>
          .
          <article-title>Ensemble methods in machine learning</article-title>
          .
          <source>In Int. Workshop on Multiple Classifier Systems</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          . SpringerVerlag.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Eberhart</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Kennedy</surname>
          </string-name>
          .
          <year>1995</year>
          .
          <article-title>A new optimizer using particle swarm theory</article-title>
          .
          <source>In Proc. of the Sixth International Symposium on Micro Machine and Human Science</source>
          ,
          <source>MHS'95</source>
          , pages
          <fpage>39</fpage>
          -
          <lpage>43</lpage>
          , Nagoya, Japan.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Eberhart</surname>
            , R. and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Shi</surname>
          </string-name>
          .
          <year>1998</year>
          .
          <article-title>A modified particle swarm optimizer</article-title>
          .
          <source>In International Conference on Evolutionary Computation</source>
          . IEEE Service Center.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Errecalde</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ingaramo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Itsa*: an effective iterative method for shorttext clustering tasks</article-title>
          .
          <source>In Proc. of the 23rd Int. Conf. on Industrial Engineering and other Applications of Applied Intelligent Systems, IEA/AIE</source>
          <year>2010</year>
          , pages
          <fpage>550</fpage>
          -
          <lpage>559</lpage>
          , Berlin, Heidelberg. Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>He</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and J.</given-names>
            <surname>Guo</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Short text feature extraction and clustering for web topic mining</article-title>
          .
          <source>In Proc. of the Third Int. Conf. on Semantics, Knowledge and Grid</source>
          , pages
          <fpage>382</fpage>
          -
          <lpage>385</lpage>
          , Washington, DC, USA. IEEE Computer Society.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Eberhart</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Swarm intelligence for permutation optimization: a case study on n-queens problem</article-title>
          .
          <source>In Proc. of the IEEE Swarm Intelligence Symposium</source>
          , pages
          <fpage>243</fpage>
          -
          <lpage>246</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Chua</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Exploiting internal and external semantics for the clustering of short texts using world knowledge</article-title>
          .
          <source>In Proc. of the 18th ACM Conf. on Information and knowledge management</source>
          , pages
          <fpage>919</fpage>
          -
          <lpage>928</lpage>
          , New York, NY, USA. ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Ingaramo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Errecalde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cagnina</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <year>2009</year>
          .
          <article-title>Computational Intelligence and Bioengineering, chapter Particle Swarm Optimization for clustering short-text corpora</article-title>
          , pages
          <fpage>3</fpage>
          -
          <lpage>19</lpage>
          . IOS press.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Ingaramo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Errecalde</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>A general bio-inspired method to improve the short-text clustering task</article-title>
          .
          <source>In Proc. of CICLing</source>
          <year>2010</year>
          , LNCS
          <volume>6008</volume>
          , pages
          <fpage>661</fpage>
          -
          <lpage>672</lpage>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Ingaramo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , David Pinto,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Errecalde</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Evaluation of internal validity measures in short-text corpora</article-title>
          .
          <source>In Proc. of the International Conference on Intelligent Text Processing and Computational Linguistics</source>
          ,
          <source>CICLing</source>
          <year>2008</year>
          , volume
          <volume>4919</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>555</fpage>
          -
          <lpage>567</lpage>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Pinto</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Bened</surname>
          </string-name>
          <article-title>´ı, and</article-title>
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Clustering narrow-domain short texts by using the Kullback-Leibler distance</article-title>
          .
          <source>In Proc. of the International Conference on Intelligent Text Processing and Computational Linguistics</source>
          ,
          <source>CICLing</source>
          <year>2007</year>
          , volume
          <volume>4394</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>611</fpage>
          -
          <lpage>622</lpage>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Ribeiro</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>G. Pereira</given-names>
            <surname>Lopes</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Extracting portuguese-spanish word translations from aligned parallel texts</article-title>
          .
          <source>Procesamiento del lenguaje natural</source>
          ,
          <volume>26</volume>
          :
          <fpage>73</fpage>
          -
          <lpage>80</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Sharoff</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <year>2002</year>
          .
          <article-title>Meaning as use: exploitation of aligned corpora for the contrastive study of lexical semantics</article-title>
          .
          <source>In Proc. of Language Resources and Evaluation Conference (LREC02)</source>
          , pages
          <fpage>447</fpage>
          -
          <lpage>452</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Steinberger</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Pouliquen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Widiger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ignat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Erjavec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tufis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Varga</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>The jrc-acquis: A multilingual aligned parallel corpus with 20+ languages</article-title>
          .
          <source>In Proc. of the 5th International Conference on Language Resources and Evaluation</source>
          (LREC'
          <year>2006</year>
          ), Genoa, Italy.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>