Using Tarjan's Red Rule for Fast Dependency (2004)
We focus on the problem of efficient learning of dependency trees. It is well-known that given the pairwise mutual information coefficients, a minimum-weight spanning tree algorithm solves this...
Mixtures of Rectangles: Interpretable Soft Clustering (2004)
To be eective, data-mining has to conclude with a succinct description of the data. To this end, we explore a clustering technique that nds dense regions in data. By constraining our model in a speci...
Using Tarjan's Red Rule for Fast Dependency (2003)
We focus on the problem of efficient learning of dependency trees. It is well-known that given the pairwise mutual information coefficients, a minimum-weight spanning tree algorithm solves this...
Using Tarjan's Red Rule for Fast Dependency Tree Construction (2002)
We focus on the problem of efficient learning of dependency trees. It is well-known that given the pairwise mutual information coefficients, a minimum-weight spanning tree algorithm solves this...
X-means: Extending K-means with Efficient Estimation of the Number of Clusters (2001)
Despite its popularity for general clustering, K-means suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is...
Mixtures of Rectangles: Interpretable Soft Clustering (2001)
To be effective, data-mining has to conclude with a succinct description of the data. To this end, we explore a clustering technique that finds dense regions in data. By constraining our model in a...
Mixtures of Rectangles: Interpretable Soft Clustering (2001)
To be effective, data-mining has to conclude
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships (2001)
Amir Ben-dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
In this work we present two new approaches for constructing phylogenetic trees. The input is a list of weighted quartets over n taxa. Each quartet is a subtree on four taxa, and its weight represents...
X-means: Extending K-means with Efficient Estimation of the Number of Clusters (2000)
Despite its popularity for general clustering, K-means suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is...
Ephemeral Document Clustering for Web Applications (2000)
Yoelle S. Maarek, Ronald Fagin, Dan Pelleg
We revisit document clustering in the context of the Web. Specifically, we investigate on-line ephemeral clustering, whereby the input document set is generated dynamically, typically by search...
We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to reduce the large number of nearest-neighbor queries issued by the traditional algorithm....
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships (1999)
Amir Ben-dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
In this work we present two new approaches for constructing phylogenetic trees. The input is a list of weighted quartets over n taxa. Each quartet is a subtree on four taxa, and its weight represents...
We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to reduce the large number of nearest-neighbor queries issued by the traditional algorithm....
Accelerating Exact k-means Algorithms with Geometric Reasoning (1999)
We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to reduce the large number of nearest-neighbor queries issued by the traditional algorithm....
Accelerating Exact k-means Algorithms with Geometric Reasoning (1998)
We present new algorithms for the k-means clustering problem. They use the kd-tree data structure to reduce the large number of nearest-neighbor queries issued by the traditional algorithm....
From four-taxon trees to phylogenies: The case of mammalian evolution (1998)
Amir Ben-dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
In this work we present two new approaches for constructing phylogenetic trees. The input is a list of weighted quartets over n taxa. Each quartet is a subtree on four taxa, and its weight represents...
Cached Sufficient Statistics for Automated Mining and Discovery from Massive Data Sources (1970)
Remi Munos, Kary Myers, Dan Pelleg
ual analysis of such data sources is now passing from being simply tedious into a new, fundamentally impossible realm where the data sources are just too large to assimilate by humans. This situation...
Ben-Dor, Amir, Chor, Benny, Pelleg, Dan
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating the physical distances between them. With the advent of this mapping...
Ben-Dor, Amir, Chor, Benny, Pelleg, Dan
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating the physical distances between them. With the advent of this mapping...