49,470 research outputs found
Incremental Clustering: The Case for Extra Clusters
The explosion in the amount of data available for analysis often necessitates
a transition from batch to incremental clustering methods, which process one
element at a time and typically store only a small subset of the data. In this
paper, we initiate the formal analysis of incremental clustering methods
focusing on the types of cluster structure that they are able to detect. We
find that the incremental setting is strictly weaker than the batch model,
proving that a fundamental class of cluster structures that can readily be
detected in the batch setting is impossible to identify using any incremental
method. Furthermore, we show how the limitations of incremental clustering can
be overcome by allowing additional clusters
Detecting Community Structure in Dynamic Social Networks Using the Concept of Leadership
Detecting community structure in social networks is a fundamental problem
empowering us to identify groups of actors with similar interests. There have
been extensive works focusing on finding communities in static networks,
however, in reality, due to dynamic nature of social networks, they are
evolving continuously. Ignoring the dynamic aspect of social networks, neither
allows us to capture evolutionary behavior of the network nor to predict the
future status of individuals. Aside from being dynamic, another significant
characteristic of real-world social networks is the presence of leaders, i.e.
nodes with high degree centrality having a high attraction to absorb other
members and hence to form a local community. In this paper, we devised an
efficient method to incrementally detect communities in highly dynamic social
networks using the intuitive idea of importance and persistence of community
leaders over time. Our proposed method is able to find new communities based on
the previous structure of the network without recomputing them from scratch.
This unique feature, enables us to efficiently detect and track communities
over time rapidly. Experimental results on the synthetic and real-world social
networks demonstrate that our method is both effective and efficient in
discovering communities in dynamic social networks
Self-tuned Visual Subclass Learning with Shared Samples An Incremental Approach
Computer vision tasks are traditionally defined and evaluated using semantic
categories. However, it is known to the field that semantic classes do not
necessarily correspond to a unique visual class (e.g. inside and outside of a
car). Furthermore, many of the feasible learning techniques at hand cannot
model a visual class which appears consistent to the human eye. These problems
have motivated the use of 1) Unsupervised or supervised clustering as a
preprocessing step to identify the visual subclasses to be used in a
mixture-of-experts learning regime. 2) Felzenszwalb et al. part model and other
works model mixture assignment with latent variables which is optimized during
learning 3) Highly non-linear classifiers which are inherently capable of
modelling multi-modal input space but are inefficient at the test time. In this
work, we promote an incremental view over the recognition of semantic classes
with varied appearances. We propose an optimization technique which
incrementally finds maximal visual subclasses in a regularized risk
minimization framework. Our proposed approach unifies the clustering and
classification steps in a single algorithm. The importance of this approach is
its compliance with the classification via the fact that it does not need to
know about the number of clusters, the representation and similarity measures
used in pre-processing clustering methods a priori. Following this approach we
show both qualitatively and quantitatively significant results. We show that
the visual subclasses demonstrate a long tail distribution. Finally, we show
that state of the art object detection methods (e.g. DPM) are unable to use the
tails of this distribution comprising 50\% of the training samples. In fact we
show that DPM performance slightly increases on average by the removal of this
half of the data.Comment: Updated ICCV 2013 submissio
Efficient Iterative Processing in the SciDB Parallel Array Engine
Many scientific data-intensive applications perform iterative computations on
array data. There exist multiple engines specialized for array processing.
These engines efficiently support various types of operations, but none
includes native support for iterative processing. In this paper, we develop a
model for iterative array computations and a series of optimizations. We
evaluate the benefits of an optimized, native support for iterative array
processing on the SciDB engine and real workloads from the astronomy domain
- …