1492 search results - page 60 / 299 » Geometric Clustering Using the Information Bottleneck Method |
149
click to vote
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
145
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
159
click to vote
AIRS
2006
Springer
15 years 8 months ago
2006
Springer
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
104
click to vote
CASCON
1997
15 years 5 months ago
1997
Decomposing complex software systems into conceptually independent subsystems represents a signi cant software engineering activity that receives considerable research attention. ...
136
Voted
PRL
2006
15 years 4 months ago
2006
This paper presents a general method for incorporating prior knowledge into kernel methods such as Support Vector Machines. It applies when the prior knowledge can be formalized b...