Dos Santos, Fabiano FernandesDe Carvalho, Veronica Oliveira [UNESP]Oliveira Rezende, Solange2014-05-272014-05-272010-12-16Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 6438 LNAI, n. PART 2, p. 163-176, 2010.0302-97431611-3349http://hdl.handle.net/11449/72231One way to organize knowledge and make its search and retrieval easier is to create a structural representation divided by hierarchically related topics. Once this structure is built, it is necessary to find labels for each of the obtained clusters. In many cases the labels have to be built using only the terms in the documents of the collection. This paper presents the SeCLAR (Selecting Candidate Labels using Association Rules) method, which explores the use of association rules for the selection of good candidates for labels of hierarchical document clusters. The candidates are processed by a classical method to generate the labels. The idea of the proposed method is to process each parent-child relationship of the nodes as an antecedent-consequent relationship of association rules. The experimental results show that the proposed method can improve the precision and recall of labels obtained by classical methods. © 2010 Springer-Verlag.163-176engassociation ruleslabel hierarchical clusteringtext miningClassical methodsHierarchical documentPrecision and recallSearch and retrievalStructural representationText miningArtificial intelligenceKnowledge representationSoft computingAssociation rulesTrabalho apresentado em evento10.1007/978-3-642-16773-7_14Acesso aberto2-s2.0-78649991980