Sciweavers

3466 search results - page 158 / 694
» Fast computation of special resultants
Sort
View
ECML
2006
Springer
15 years 10 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
15 years 10 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
IJCAI
2007
15 years 8 months ago
Logistic Regression Models for a Fast CBIR Method Based on Feature Selection
Distance measures like the Euclidean distance have been the most widely used to measure similarities between feature vectors in the content-based image retrieval (CBIR) systems. H...
Riadh Ksantini, Djemel Ziou, Bernard Colin, Fran&c...
ACL
2003
15 years 8 months ago
Fast Methods for Kernel-Based Text Analysis
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
Taku Kudo, Yuji Matsumoto
ICMLA
2003
15 years 8 months ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios