Sciweavers

421 search results - page 12 / 85
» A divide-and-merge methodology for clustering
Sort
View
MLDM
1999
Springer
15 years 10 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
CASES
2001
ACM
15 years 9 months ago
Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures
In this paper we describe a design exploration methodology for clustered VLIW architectures. The central idea of this work is a set of three techniques aimed at reducing the cost ...
Marcio Buss, Rodolfo Azevedo, Paulo Centoducatte, ...
ECSQARU
1997
Springer
15 years 9 months ago
Creating Prototypes for Fast Classification in Dempster-Shafer Clustering
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
Johan Schubert
CSMR
2005
IEEE
15 years 11 months ago
Clustering Data Retrieved from Java Source Code to Support Software Maintenance: A Case Study
Data mining is a technology recently used in support of software maintenance in various contexts. Our works focuses on achieving a high level understanding of Java systems without...
Dimitris Rousidis, Christos Tjortjis
CIT
2007
Springer
16 years 7 days ago
Performance Assessment of Some Clustering Algorithms Based on a Fuzzy Granulation-Degranulation Criterion
In this paper a fuzzy quantization dequantization criterion is used to propose an evaluation technique to determine the appropriate clustering algorithm suitable for a particular ...
Sriparna Saha, Sanghamitra Bandyopadhyay