Sciweavers

1628 search results - page 38 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
ICIP
2004
IEEE
16 years 21 days ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
73
Voted
COMAD
2009
15 years 6 days ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
EWCBR
2006
Springer
15 years 2 months ago
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
Kalyan Moy Gupta, David W. Aha, Philip Moore
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
15 years 3 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
15 years 2 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha