Sciweavers

165 search results - page 25 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
HAIS
2009
Springer
14 years 1 months ago
Unsupervised Feature Selection in High Dimensional Spaces and Uncertainty
Developing models and methods to manage data vagueness is a current effervescent research field. Some work has been done with supervised problems but unsupervised problems and unce...
José Ramón Villar, María del ...
CEAS
2008
Springer
13 years 11 months ago
A Campaign-based Characterization of Spamming Strategies
This paper presents a methodology for the characterization of spamming strategies based on the identification of spam campaigns. To deeply understand how spammers abuse network re...
Pedro Calais, Douglas Pires, Dorgival Olavo Guedes...
CIKM
2009
Springer
14 years 3 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 6 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 9 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...