نتایج جستجو برای: hierarchical analysis

تعداد نتایج: 2886433  

2014
Hsun-Chih Kuo Miin-Shen Yang Jenn-Hwai Yang Yen-Chi Chen

Eisen’s tree view is a useful tool for clustering and displaying of microarray gene expression data. In Eisen’s tree view system, a hierarchical method is used for clustering data. However, some useful information in gene expression data may not be well drawn when a hierarchical clustering is directly used in Eisen’s tree view. In this paper, we embed the similarity-based clustering method (SCM...

2002
Vuokko Vuori Jorma Laaksonen

This work reports experiments with four hierarchical clustering algorithms and two clustering indices for online handwritten characters. The main motivation of the work is to develop an automatic method for finding a set of prototypical characters which would represent well the different writing styles present in a large international database. One of the major obstacles in achieving this goal ...

2014
Camille Guinaudeau Antoine Laurent Hervé Bredin

This paper provides an overview of the Social Event Detection (SED) system developed at LIMSI for the 2014 campaign. Our approach is based on a hierarchical agglomerative clustering that uses textual metadata, user-based knowledge and geographical information. These different sources of knowledge, either used separately or in cascade, reach good results for the full clustering subtask with a no...

2007
Natascha Hoebel Roberto V. Zicari

This paper addresses the issue of how to define clusters of web visitors with respect to their behavior and supposed interests. We will use the non-obvious user profiles (NOPs) approach defined in [10], and present a new clustering algorithm which is a combination of hierarchical clustering together with a centroid based method with priority, which allows to cluster web users by similar interes...

2013
Ding Tu Ling Chen Gencai Chen

In this paper, we propose an approach to build a multi-way concept hierarchy from a text corpus, which is based on WordNet and multi-way hierarchical clustering. In addition, a new evaluation metric is presented, and our approach is compared with 4 kinds of existing methods on the Amazon Customer Review data set.

2013
Elena TOMA

Rural tourism from Western Carpathian Mountain was characterized in the last years by a low occupancy rate and a decline in tourist arrivals, due, beside of the direct effects of economic crises, to the remote location of mountain villages and to the low quality of infrastructure. For this reason we consider that the implementation of complex and integrated products based on tour thematic circu...

2010
Zhao Li Xindong Wu

Document clustering has been applied in web information retrieval, which facilitates users’ quick browsing by organizing retrieved results into different groups. Meanwhile, a tree-like hierarchical structure is wellsuited for organizing the retrieved results in favor of web users. In this regard, we introduce a new method for hierarchical clustering of web snippets by exploiting a phrase-based ...

Journal: :IJSCCPS 2011
Owen Macindoe Whitman Richards

We introduce a novel technique for characterising networks using the structure of their sub-graphs, which we call the network’s fine structure. To judge the similarities between networks we use the earth mover’s distance between the distributions of features of their constituent sub-graphs. This technique is an abstraction of graph edit-distance. Given these similarity measures we explore their...

Journal: :CoRR 2012
Álvaro Martínez-Pérez

We define a hierarchical clustering method: α-unchaining single linkage or SL(α). The input of this algorithm is a finite metric space and a certain parameter α. This method is sensitive to the density of the distribution and offers some solution to the so called chaining effect. We also define a modified version, SL∗(α), to treat the chaining through points or small blocks. We study the theore...

2007
Selim Mimaroglu Dan A. Simovici

We propose an algorithm that computes an approximation of the set of frequent item sets by using the bit sequence representation of the associations between items and transactions. The algorithm is obtained by modifying a hierarchical agglomerative clustering algorithm and takes advantage of the speed that bit operations afford. The algorithm offers a very significant speed advantage over stand...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید