Sciweavers

971 search results - page 106 / 195
» Mining Several Data Bases with an Ensemble of Classifiers
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 29 days ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh
ICDM
2007
IEEE
96views Data Mining» more  ICDM 2007»
14 years 3 months ago
The Chosen Few: On Identifying Valuable Patterns
Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine learning technique could m...
Björn Bringmann, Albrecht Zimmermann
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
14 years 6 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha
AIIA
2005
Springer
14 years 2 months ago
Mining Relational Association Rules for Propositional Classification
In traditional classification setting, training data are represented as a single table, where each row corresponds to an example and each column to a predictor variable or the targ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
EMNLP
2009
13 years 6 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti