Sciweavers

1603 search results - page 263 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
15 years 10 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
WAIM
2009
Springer
15 years 10 months ago
SLICE: A Novel Method to Find Local Linear Correlations by Constructing Hyperplanes
Finding linear correlations in dataset is an important data mining task, which can be widely applied in the real world. Existing correlation clustering methods combine clustering w...
Liang Tang, Changjie Tang, Lei Duan, Yexi Jiang, J...
CIKM
2009
Springer
15 years 10 months ago
Graph-based seed selection for web-scale crawlers
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 10 months ago
Evolutionary optimization of multistage interconnection networks performance
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
Jirí Jaros
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 10 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...