<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1870-9044</journal-id>
<journal-title><![CDATA[Polibits]]></journal-title>
<abbrev-journal-title><![CDATA[Polibits]]></abbrev-journal-title>
<issn>1870-9044</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1870-90442013000100005</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[TopicSearch-Personalized Web Clustering Engine Using Semantic Query Expansion, Memetic Algorithms and Intelligent Agents]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mendoza]]></surname>
<given-names><![CDATA[Martha]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[León]]></surname>
<given-names><![CDATA[Elizabeth]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Manic]]></surname>
<given-names><![CDATA[Milos]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Herrera-Viedma]]></surname>
<given-names><![CDATA[Enrique]]></given-names>
</name>
<xref ref-type="aff" rid="A04"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,University of Cauca  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Nacional de Colombia  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="A03">
<institution><![CDATA[,University of Idaho  ]]></institution>
<addr-line><![CDATA[Idaho Falls ]]></addr-line>
<country>USA</country>
</aff>
<aff id="A04">
<institution><![CDATA[,University of Granada  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Spain</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>07</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>07</month>
<year>2013</year>
</pub-date>
<numero>47</numero>
<fpage>31</fpage>
<lpage>45</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1870-90442013000100005&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1870-90442013000100005&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1870-90442013000100005&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[As resources become more and more available on the Web, so the difficulties associated with finding the desired information increase. Intelligent agents can assist users in this task since they can search, filter and organize information on behalf of their users. Web document clustering techniques can also help users to find pages that meet their information requirements. This paper presents a personalized web document clustering called TopicSearch. TopicSearch introduces a novel inverse document frequency function to improve the query expansion process, a new memetic algorithm for web document clustering, and frequent phrases approach for defining cluster labels. Each user query is handled by an agent who coordinates several tasks including query expansion, search results acquisition, preprocessing of search results, cluster construction and labeling, and visualization. These tasks are performed by specialized agents whose execution can be parallelized in certain instances. The model was successfully tested on fifty DMOZ datasets. The results demonstrated improved precision and recall over traditional algorithms (k-means, Bisecting k-means, STC y Lingo). In addition, the presented model was evaluated by a group of twenty users with 90% being in favor of the model.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Web document clustering]]></kwd>
<kwd lng="en"><![CDATA[intelligent agents]]></kwd>
<kwd lng="en"><![CDATA[query expansion]]></kwd>
<kwd lng="en"><![CDATA[WordNet]]></kwd>
<kwd lng="en"><![CDATA[memetic algorithms]]></kwd>
<kwd lng="en"><![CDATA[user profile]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="center"><font face="verdana" size="4"><b>TopicSearch&#151;Personalized Web Clustering Engine Using Semantic Query Expansion, Memetic Algorithms and Intelligent Agents</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>      <p align="center"><font face="verdana" size="2"><b>Carlos Cobos<sup>1</sup>, Martha Mendoza<sup>1</sup>, Elizabeth Le&oacute;n<sup>2</sup>, Milos Manic<sup>3</sup>, and Enrique Herrera&#45;Viedma<sup>4</sup></b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><sup>1</sup> <i> University of Cauca, Colombia</i> (e&#45;mail: <a href="mailto:ccobos@unicauca.edu.co">ccobos@unicauca.edu.co</a>, <a href="mailto:mmendoza@unicauca.edu.co">mmendoza@unicauca.edu.co</a>).</font></p>     <p align="justify"><font face="verdana" size="2"><sup>2</sup> <i> Universidad Nacional de Colombia, Colombia</i> (e&#45;mail: <a href="mailto:eleonguz@unal.edu.co">eleonguz@unal.edu.co</a><a href="mailto:eleonguz@unal.edu.co">)</a>.</font></p>     <p align="justify"><font face="verdana" size="2"><sup>3</sup> <i> University of Idaho at Idaho Falls, USA</i> (e&#45;mail: <a href="mailto:misko@uidaho.edu">misko@uidaho.edu</a><a href="mailto:misko@uidaho.edu">)</a></font></p>     <p align="justify"><font face="verdana" size="2"><sup>4</sup> <i> University of Granada, Spain</i> (e&#45;mail: <a href="mailto:viedma@decsai.ugr.es">viedma@decsai.ugr.es</a>)</font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Manuscript received on March 13, 2013.    <br> Accepted for publication on May 23, 2013.</font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p> 	    <p align="justify"><font face="verdana" size="2">As resources become more and more available on the Web, so the difficulties associated with finding the desired information increase. Intelligent agents can assist users in this task since they can search, filter and organize information on behalf of their users. Web document clustering techniques can also help users to find pages that meet their information requirements. This paper presents a personalized web document clustering called TopicSearch. TopicSearch introduces a novel inverse document frequency function to improve the query expansion process, a new memetic algorithm for web document clustering, and frequent phrases approach for defining cluster labels. Each user query is handled by an agent who coordinates several tasks including query expansion, search results acquisition, preprocessing of search results, cluster construction and labeling, and visualization. These tasks are performed by specialized agents whose execution can be parallelized in certain instances. The model was successfully tested on fifty DMOZ datasets. The results demonstrated improved precision and recall over traditional algorithms (k&#45;means, Bisecting k&#45;means, STC y Lingo). In addition, the presented model was evaluated by a group of twenty users with 90% being in favor of the model.</font></p>      <p align="justify"><font face="verdana" size="2"><b>Key words: </b>Web document clustering, intelligent agents, query expansion, WordNet, memetic algorithms, user profile.</font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/poli/n47/n47a5.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>ACKNOWLEDGMENT</b></font></p>      ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">The work in this paper was supported by a Research Grant from the University of Cauca under Project VRI&#45;2560 and the National University of Colombia.</font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>      <p align="justify"><font face="verdana" size="2"><b>REFERENCES</b></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#091;1&#93; C. Carpineto, <i>et al,</i> "A survey of Web clustering engines," <i>ACM Comput. Surv.,</i> vol. 41, pp. 1&#45;38, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081588&pid=S1870-9044201300010000500001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; R. Baeza&#45;Yates, A. and B. Ribeiro&#45;Neto, <i>Modern InformationRetrieval:</i> Addison&#45;Wesley Longman Publishing Co., Inc., 1999.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081590&pid=S1870-9044201300010000500002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#091;3&#93; C. Carpineto, et al, "Evaluating subtoplc retrieval methods: Clustering versus diversification of search results," <i>Information Processing & Management</i>, vol. 48, pp. 358-373, 2012.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081592&pid=S1870-9044201300010000500003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; K. Hammouda, "Web Mining: Clustering Web Documents A Preliminary Review," ed, 2001, pp. 1-13.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081594&pid=S1870-9044201300010000500004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font> </p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; A. K. Jain and R. C. Dubes, <i>Algorithms for clustering data</i>: Prentice-Hall, Inc., 1988.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081596&pid=S1870-9044201300010000500005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; M. Steinbach, et al, "A comparison of document clustering techniques," in <i>KDD workshop on text mining</i>, Boston, MA, USA., 2000, pp. 1-20.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081598&pid=S1870-9044201300010000500006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; Y. Li, et al, "Text document clustering based on frequent word meaning sequences," <i>Data & Knowledge Engineering</i>, vol. 64, pp. 381-404, 2008</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081600&pid=S1870-9044201300010000500007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; Z. Oren and E. Oren, "Web document clustering: a feasibility demonstration," presented at the Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, Melbourne, Australia, 1998.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081601&pid=S1870-9044201300010000500008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; M. Mahdavi and H. Abolhassani, "Harmony K-means algorithm for document clustering," <i>Data Mining and Knowledge Discovery</i>, vol. 18, pp. 370-391, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081603&pid=S1870-9044201300010000500009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; P. Berkhin, et al, "A Survey of Clustering Data Mining Techniques," in <i>Grouping Multidimensional Data</i>, ed: Springer-Verlag, 2006, pp. 25-71.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081605&pid=S1870-9044201300010000500010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93; S. Osi&#324;ski and D. Weiss, "A concept-driven algorithm for clustering search results," <i>Intelligent Systems, IEEE</i>, vol. 20, pp. 48-54, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081607&pid=S1870-9044201300010000500011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; D. Zhang and Y. Dong, "Semantic, Hierarchical, Mine Clustering of Web Search Results," in <i>Advanced Web Technologies and Applications</i>, ed, 2004, pp. 69-78.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081609&pid=S1870-9044201300010000500012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; B. Fung, et al, "Hierarchical document clustering using frequent itemsets," in <i>Proceedings of the SIAM International Conference on Data Mining</i>, 2003, pp. 59-70.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081611&pid=S1870-9044201300010000500013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; G Mecca, et al, "A new algorithm for clustering search results," <i>Data & Knowledge Engineering</i>, vol. 62, pp. 504-522, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081613&pid=S1870-9044201300010000500014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> </font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; F. Beil,<i> et al, "Frequent term-based text clustering," in KDD '02: International conference on Knowledge discovery and data mining (ACM SIGKDD)</i>, Edmonton, Alberta, Canada, 2002, pp. 436-442.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081615&pid=S1870-9044201300010000500015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; L. Jing, "Survey of Text Clustering," ed, 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081617&pid=S1870-9044201300010000500016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; W. Song et al, "Genetic algorithm for text clustering using ontology and evaluating the validity of various semantic similarity measures" <i>Expert Systems with Applications</i>, vol. 36, pp. 9095-9104, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081619&pid=S1870-9044201300010000500017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; L. Xiang-Wei, et al, "The research of text clustering algorithms based on frequent term sets," in <i>Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on</i>, 2005, pp. 2352-2356 Vol. 4.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081621&pid=S1870-9044201300010000500018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; A. K. Jain, et al, "Data clustering: a review," <i>ACM Comput. Surv.</i>, vol. 31, pp. 264-323, 1999.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081623&pid=S1870-9044201300010000500019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;20&#93; S. Osi&#324;ski and D. Weiss, "Carrot 2: Design of a Flexible and Efficient Web Information Retrieval Framework," in <i>Advances in Web Intelligence</i>, ed, 2005, pp. 439-444.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081625&pid=S1870-9044201300010000500020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;21&#93; X. Wei, et al, "Document clustering based on non-negative matrix factorization," presented at the Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, Toronto, Canada, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081627&pid=S1870-9044201300010000500021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;22&#93; Z. Zhong-Yuan and J. Zhang, "Survey on the Variations and Applications of Nonnegative Matrix Factorization," <i>ISORA'10: The Ninth International Symposium on Operations Research and Its Applications</i>, Chengdu-Jiuzhaigou, China, 2010, pp. 317-323.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081629&pid=S1870-9044201300010000500022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;23&#93; Z. Geem, <i>et al</i>, "A New Heuristic Optimization Algorithm: Harmony Search," <i>Simulation</i>, vol. 76, pp. 60-68, 2001.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081631&pid=S1870-9044201300010000500023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;24&#93; R. Forsati, <i>et al</i>, "Hybridization of K-Means and Harmony Search Methods for Web Page Clustering," in <i>WI-IAT '08: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology</i>, 2008, pp. 329-335.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081633&pid=S1870-9044201300010000500024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;25&#93; M. Mahdavi, <i>et al</i>, "Novel meta-heunstic algorithms for clustering web documents," <i>Applied Mathematics and Computation</i>, vol. 201, pp. 441-451, 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081635&pid=S1870-9044201300010000500025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;26&#93; W. Song and S. Park, "Genetic Algorithm-Based Text Clustering Technique," in <i>Advances in Natural Computation</i>, ed, 2006, pp. 779-782.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081637&pid=S1870-9044201300010000500026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;27&#93; C. Cobos, <i>et al</i>, "Web document clustering based on Global-Best Harmony Search, K-means, Frequent Term Sets and Bayesian Information Criterion," in <i>2010 IEEE Congress on Evolutionary Computation (CEC)</i>, Barcelona, Spain, 2010, pp. 4637-4644.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081639&pid=S1870-9044201300010000500027&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;28&#93; C. Cobos, <i>et al</i>, "Web Document Clustering based on a New Niching Memetic Algorithm, Term-Document Matrix and Bayesian Information Criterion," in <i>2010 IEEE Congress on Evolutionary Computation (CEC)</i>, Barcelona, Spain, 2010, pp. 4629-4636.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081641&pid=S1870-9044201300010000500028&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;29&#93; C. Manning, <i>et al</i>. (2008). <i>Introduction to Information Retrieval</i>. Available: <a href="http://www-csli.stanford.edu/~hinrich/information-retrievalbook.html" target="_blank">http://www&#45;csli.stanford.edu/&#126;hinrich/information&#45;retrievalbook.html</a></font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081643&pid=S1870-9044201300010000500029&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;30&#93; L. Yongli, <i>et al</i>, "A Query Expansion Algorithm Based on Phrases Semantic Similarity," presented at the Proceedings of the 2008 International Symposiums on Information Processing, 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081644&pid=S1870-9044201300010000500030&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;31&#93; S. E. Robertson and K. Sparck-Jones, "Relevance weighting of search terms," in <i>Document retrieval systems</i>, ed: Taylor Graham Publishing, 1988, pp. 143-160.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081646&pid=S1870-9044201300010000500031&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;32&#93; C. Cobos, <i>et al</i>, "Algoritmos de Expansi&oacute;n de Consulta basados en una Nueva Funci&oacute;n Discreta de Relevancia," <i>Revista UIS Ingenier&iacute;as</i>, vol. 10, pp. 9-22, Junio 2011.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081648&pid=S1870-9044201300010000500032&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p><font face="verdana" size="2">&#91;33&#93; Q. H. Nguyen, <i>et al</i>, "A study on the design issues of Memetic Algorithm," in <i>Evolutionary Computation, 2007. CEC 2007. IEEE Congress on</i>, 2007, pp. 2390-2397.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081650&pid=S1870-9044201300010000500033&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;34&#93; A. Webb, <i>Statistical Pattern Recognition, 2nd Edition</i>: {John Wiley & Sons}, 2002.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081652&pid=S1870-9044201300010000500034&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;35&#93; S. J. Redmond and C. Heneghan, "A method for initialising the K-means clustering algorithm using kd-trees," <i>Pattern Recognition Letters</i>, vol. 28, pp. 965-973, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081654&pid=S1870-9044201300010000500035&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> </font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;36&#93; M. Mitchell, <i>An Introduction to Genetic Algorithms</i>. Cambridge, MA, USA: The MIT Press, 1999.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081656&pid=S1870-9044201300010000500036&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> </font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;37&#93; D. E. Goldberg, <i>Genetic Algorithms in Search, Optimization and Machine Learning</i>: Addison-Wesley Longman Publishing Co., Inc., 1989.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081658&pid=S1870-9044201300010000500037&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> </font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;38&#93; T. Matsumoto and E. Hung, "Fuzzy clustering and relevance ranking of web search results with differentiating cluster label generation," in <i>Fuzzy Systems (FUZZ), 2010 IEEE International Conference on</i>, 2010, pp.1-8.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081660&pid=S1870-9044201300010000500038&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;39&#93; E. Amig&oacute;, <i>et al</i>, "A comparison of extrinsic clustering evaluation metrics based on formal constraints,"<i> Inf Retr.</i>, vol. 12, pp. 461-486, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081662&pid=S1870-9044201300010000500039&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p><font face="verdana" size="2">&#91;40&#93; S. Osi&#324;ski, "An Algorithm for clustering of web search results," Master, Pozna&#324; University of Technology, Poland, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6081664&pid=S1870-9044201300010000500040&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>       ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carpineto]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A survey of Web clustering engines]]></article-title>
<source><![CDATA[ACM Comput. Surv.]]></source>
<year>2009</year>
<volume>41</volume>
<page-range>1-38</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baeza-Yates]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ribeiro-Neto]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modern InformationRetrieval]]></source>
<year>1999</year>
<publisher-name><![CDATA[Addison-Wesley Longman Publishing Co., Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carpineto]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Evaluating subtoplc retrieval methods: Clustering versus diversification of search results]]></article-title>
<source><![CDATA[Information Processing & Management]]></source>
<year>2012</year>
<volume>48</volume>
<page-range>358-373</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hammouda]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Web Mining: Clustering Web Documents A Preliminary Review]]></source>
<year>2001</year>
<page-range>1-13</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Dubes]]></surname>
<given-names><![CDATA[R. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithms for clustering data]]></source>
<year>1988</year>
<publisher-name><![CDATA[Prentice-Hall, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Steinbach]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A comparison of document clustering techniques]]></article-title>
<source><![CDATA[KDD workshop on text mining]]></source>
<year>2000</year>
<page-range>1-20</page-range><publisher-loc><![CDATA[Boston^eMA MA]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Text document clustering based on frequent word meaning sequences]]></article-title>
<source><![CDATA[Data & Knowledge Engineering]]></source>
<year>2008</year>
<volume>64</volume>
<page-range>381-404</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Oren]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Oren]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Web document clustering: a feasibility demonstration]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval]]></conf-name>
<conf-date>1998</conf-date>
<conf-loc>Melbourne </conf-loc>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mahdavi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Abolhassani]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Harmony K-means algorithm for document clustering]]></article-title>
<source><![CDATA[Data Mining and Knowledge Discovery]]></source>
<year>2009</year>
<volume>18</volume>
<page-range>370-391</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berkhin]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Survey of Clustering Data Mining Techniques]]></article-title>
<source><![CDATA[Grouping Multidimensional Data]]></source>
<year>2006</year>
<page-range>25-71</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osi&#324;ski]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Weiss]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A concept-driven algorithm for clustering search results]]></article-title>
<source><![CDATA[Intelligent Systems, IEEE]]></source>
<year>2005</year>
<volume>20</volume>
<page-range>48-54</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Semantic, Hierarchical, Mine Clustering of Web Search Results]]></article-title>
<source><![CDATA[Advanced Web Technologies and Applications]]></source>
<year>2004</year>
<page-range>69-78</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fung]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Hierarchical document clustering using frequent itemsets]]></article-title>
<source><![CDATA[Proceedings of the SIAM International Conference on Data Mining]]></source>
<year>2003</year>
<page-range>59-70</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mecca]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new algorithm for clustering search results]]></article-title>
<source><![CDATA[Data & Knowledge Engineering]]></source>
<year>2007</year>
<volume>62</volume>
<page-range>504-522</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beil]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Frequent term-based text clustering]]></article-title>
<source><![CDATA[KDD '02: International conference on Knowledge discovery and data mining (ACM SIGKDD)]]></source>
<year>2002</year>
<page-range>436-442</page-range><publisher-loc><![CDATA[Edmonton^eAlberta Alberta]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jing]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Survey of Text Clustering]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Genetic algorithm for text clustering using ontology and evaluating the validity of various semantic similarity measures]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2009</year>
<volume>36</volume>
<page-range>9095-9104</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xiang-Wei]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The research of text clustering algorithms based on frequent term sets]]></article-title>
<source><![CDATA[Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on]]></source>
<year>2005</year>
<volume>4</volume>
<page-range>2352-2356</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Data clustering: a review]]></article-title>
<source><![CDATA[ACM Comput. Surv.]]></source>
<year>1999</year>
<volume>31</volume>
<page-range>264-323</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osi&#324;ski]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Weiss]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Carrot 2: Design of a Flexible and Efficient Web Information Retrieval Framework]]></article-title>
<source><![CDATA[Advances in Web Intelligence]]></source>
<year>2005</year>
<page-range>439-444</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wei]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Document clustering based on non-negative matrix factorization]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc>Toronto </conf-loc>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhong-Yuan]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Survey on the Variations and Applications of Nonnegative Matrix Factorization]]></article-title>
<source><![CDATA[ISORA'10: The Ninth International Symposium on Operations Research and Its Applications]]></source>
<year>2010</year>
<page-range>317-323</page-range><publisher-loc><![CDATA[ChengduJiuzhaigou ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A New Heuristic Optimization Algorithm: Harmony Search]]></article-title>
<source><![CDATA[Simulation]]></source>
<year>2001</year>
<volume>76</volume>
<page-range>60-68</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Forsati]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Hybridization of K-Means and Harmony Search Methods for Web Page Clustering]]></article-title>
<source><![CDATA[WI-IAT '08: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology]]></source>
<year>2008</year>
<page-range>329-335</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mahdavi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Novel meta-heunstic algorithms for clustering web documents]]></article-title>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2008</year>
<volume>201</volume>
<page-range>441-451</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Genetic Algorithm-Based Text Clustering Technique]]></article-title>
<source><![CDATA[Advances in Natural Computation]]></source>
<year>2006</year>
<page-range>779-782</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Web document clustering based on Global-Best Harmony Search, K-means, Frequent Term Sets and Bayesian Information Criterion]]></article-title>
<source><![CDATA[2010 IEEE Congress on Evolutionary Computation (CEC)]]></source>
<year>2010</year>
<page-range>4637-4644</page-range><publisher-loc><![CDATA[Barcelona ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Web Document Clustering based on a New Niching Memetic Algorithm, Term-Document Matrix and Bayesian Information Criterion]]></article-title>
<source><![CDATA[2010 IEEE Congress on Evolutionary Computation (CEC)]]></source>
<year>2010</year>
<page-range>4629-4636</page-range><publisher-loc><![CDATA[Barcelona ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Manning]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Information Retrieval]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yongli]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Query Expansion Algorithm Based on Phrases Semantic Similarity]]></article-title>
<source><![CDATA[Proceedings of the 2008 International Symposiums on Information Processing]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Robertson]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Sparck-Jones]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Relevance weighting of search terms]]></article-title>
<source><![CDATA[Document retrieval systems]]></source>
<year>1988</year>
<page-range>143-160</page-range><publisher-name><![CDATA[Taylor Graham Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="es"><![CDATA[Algoritmos de Expansión de Consulta basados en una Nueva Función Discreta de Relevancia]]></article-title>
<source><![CDATA[Revista UIS Ingenierías]]></source>
<year>Juni</year>
<month>o </month>
<day>20</day>
<volume>10</volume>
<page-range>9-22</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[Q. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A study on the design issues of Memetic Algorithm]]></article-title>
<source><![CDATA[Evolutionary Computation, 2007. CEC 2007. IEEE Congress on]]></source>
<year>2007</year>
<page-range>2390-2397</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Webb]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Statistical Pattern Recognition]]></source>
<year>2002</year>
<edition>2</edition>
<publisher-name><![CDATA[John Wiley & Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Redmond]]></surname>
<given-names><![CDATA[S. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Heneghan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A method for initialising the K-means clustering algorithm using kd-trees]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>2007</year>
<volume>28</volume>
<page-range>965-973</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mitchell]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[An Introduction to Genetic Algorithms]]></source>
<year>1999</year>
<publisher-loc><![CDATA[Cambridge^eMA MA]]></publisher-loc>
<publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic Algorithms in Search, Optimization and Machine Learning]]></source>
<year>1989</year>
<publisher-name><![CDATA[Addison-Wesley Longman Publishing Co., Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Matsumoto]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Hung]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fuzzy clustering and relevance ranking of web search results with differentiating cluster label generation]]></article-title>
<source><![CDATA[Fuzzy Systems (FUZZ), 2010 IEEE International Conference on]]></source>
<year>2010</year>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B39">
<label>39</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Amigó]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A comparison of extrinsic clustering evaluation metrics based on formal constraints]]></article-title>
<source><![CDATA[Inf Retr.]]></source>
<year>2009</year>
<volume>12</volume>
<page-range>461-486</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>40</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osi&#324;ski]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[An Algorithm for clustering of web search results]]></source>
<year>2003</year>
<publisher-name><![CDATA[Pozna&#324; University of Technology]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
