For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
This paper presents an automated partitioning strategy to divide a design into a set of partitions based on design hierarchy information. While the primary objective is to use the...
Mehrdad Eslami Dehkordi, Stephen Dean Brown, Terry...
We present a class of models that, via a simple construction,
enables exact, incremental, non-parametric, polynomial-time,
Bayesian inference of conditional measures. The approac...
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow...