Sciweavers

459 search results - page 5 / 92
» A general model for clustering binary data
Sort
View
IJCNN
2000
IEEE
14 years 1 days ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
WWW
2009
ACM
14 years 2 months ago
A general framework for adaptive and online detection of web attacks
Detection of web attacks is an important issue in current defense-in-depth security framework. In this paper, we propose a novel general framework for adaptive and online detectio...
Wei Wang 0012, Florent Masseglia, Thomas Guyet, Re...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
TDP
2010
140views more  TDP 2010»
13 years 2 months ago
Movement Data Anonymity through Generalization
In recent years, spatio-temporal and moving objects databases have gained considerable interest, due to the diffusion of mobile devices (e.g., mobile phones, RFID devices and GPS ...
Anna Monreale, Gennady L. Andrienko, Natalia V. An...