Sciweavers

51 search results - page 9 / 11
» K-medoid-style Clustering Algorithms for Supervised Summary ...
Sort
View
ISMIS
2005
Springer
13 years 12 months ago
Learning the Daily Model of Network Traffic
Abstract. Anomaly detection is based on profiles that represent normal behaviour of users, hosts or networks and detects attacks as significant deviations from these profiles. In t...
Costantina Caruso, Donato Malerba, Davide Papagni
NIPS
2003
13 years 7 months ago
Computing Gaussian Mixture Models with EM Using Equivalence Constraints
Density estimation with Gaussian Mixture Models is a popular generative technique used also for clustering. We develop a framework to incorporate side information in the form of e...
Noam Shental, Aharon Bar-Hillel, Tomer Hertz, Daph...
HT
2005
ACM
13 years 12 months ago
As we may perceive: inferring logical documents from hypertext
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
Pavel Dmitriev, Carl Lagoze, Boris Suchkov
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 6 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 3 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki