Sciweavers

538 search results - page 40 / 108
» Dimension induced clustering
Sort
View
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 10 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
KES
2007
Springer
14 years 2 months ago
A Hierarchical Clustering Method for Semantic Knowledge Bases
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
Nicola Fanizzi, Claudia d'Amato
IDEAL
2005
Springer
14 years 2 months ago
Cluster Analysis of High-Dimensional Data: A Case Study
Abstract. Normal mixture models are often used to cluster continuous data. However, conventional approaches for fitting these models will have problems in producing nonsingular es...
Richard Bean, Geoffrey J. McLachlan
EDBT
2010
ACM
170views Database» more  EDBT 2010»
13 years 11 months ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...
TSMC
2010
13 years 3 months ago
Fractional Particle Swarm Optimization in Multidimensional Search Space
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
Serkan Kiranyaz, Turker Ince, E. Alper Yildirim, M...