<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF25106</article-id><article-id pub-id-type="doi">10.15388/Informatica.2014.06</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>A Study of Improving the Performance of Mining Multi-Valued and Multi-Labeled Data<xref ref-type="fn" rid="fn1"><sup>✩</sup></xref></article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Tsai</surname><given-names>Cheng-Jung</given-names></name><email xlink:href="mailto:cjtsai@cc.ncue.edu.tw">cjtsai@cc.ncue.edu.tw</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Institute of Statistics and Information Science, National Changhua University of Education, Changhua, Taiwan, R.O.C</aff></contrib-group><author-notes><fn id="fn1"><label><sup>✩</sup></label><p>Tel.: +886-4-7232105.ext.3242; Fax: +886-4-7211192.</p></fn></author-notes><pub-date pub-type="epub"><day>01</day><month>01</month><year>2014</year></pub-date><volume>25</volume><issue>1</issue><fpage>95</fpage><lpage>111</lpage><history><date date-type="received"><day>01</day><month>09</month><year>2011</year></date><date date-type="accepted"><day>01</day><month>09</month><year>2013</year></date></history><abstract><p>Nowadays data mining algorithms are successfully applying to analyze the real data in our life to provide useful suggestion. Since some available real data is multi-valued and multi-labeled, researchers have focused their attention on developing approaches to mine multi-valued and multi-labeled data in recent years. Unfortunately, there are no algorithms can discretize multi-valued and multi-labeled data to improve the performance of data mining. In this paper, we proposed a novel approach to solve this problem. Our approach is based on a statistical-based discretization metric and the simulated annealing search algorithm. Experimental results show that our approach can effectively improve the performance of the-state-of-art multi-valued and multi-labeled classification algorithm.</p></abstract><kwd-group><label>Keywords</label><kwd>data mining</kwd><kwd>classification</kwd><kwd>multi-valued</kwd><kwd>multi-labeled</kwd><kwd>discretization</kwd><kwd>simulated annealing search</kwd></kwd-group></article-meta></front></article>