Sciweavers

265 search results - page 43 / 53
» Context in Artificial Intelligence: I. A Survey of the Liter...
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 7 months ago
Real-time ranking with concept drift using expert advice
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...
Hila Becker, Marta Arias
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 7 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 7 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
CHI
2007
ACM
14 years 7 months ago
CAAD: an automatic task support system
Recent HCI research shows a strong interest in task management systems (e.g. [19, 27]) that support the multitasked nature of information work [13]. These systems either require m...
Tye Rattenbury, John F. Canny
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
14 years 1 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann