Sciweavers

1973 search results - page 220 / 395
» The Construction of Ludic Space
Sort
View
DMIN
2007
158views Data Mining» more  DMIN 2007»
15 years 8 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
JAC
2008
15 years 8 months ago
Quantization of cellular automata
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
Pablo Arrighi, Vincent Nesme
NIPS
2008
15 years 8 months ago
Learning the Semantic Correlation: An Alternative Way to Gain from Unlabeled Text
In this paper, we address the question of what kind of knowledge is generally transferable from unlabeled text. We suggest and analyze the semantic correlation of words as a gener...
Yi Zhang 0010, Jeff Schneider, Artur Dubrawski
NIPS
2007
15 years 8 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 7 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman