Sciweavers

728 search results - page 108 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
ICFCA
2009
Springer
14 years 2 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
NIPS
2001
13 years 9 months ago
Active Learning in the Drug Discovery Process
We investigate the following data mining problem from Computational Chemistry: From a large data set of compounds, find those that bind to a target molecule in as few iterations o...
Manfred K. Warmuth, Gunnar Rätsch, Michael Ma...
TNN
2008
114views more  TNN 2008»
13 years 7 months ago
Relevance-Based Feature Extraction for Hyperspectral Images
Abstract--Hyperspectral imagery affords researchers all discriminating details needed for fine delineation of many material classes. This delineation is essential for scientific re...
Michael J. Mendenhall, Erzsébet Meré...
GIS
2007
ACM
14 years 8 months ago
Environmental scenario search and visualization
We have developed Environmental Scenario Search Engine (ESSE) for parallel data mining of a set of conditions inside distributed, very large databases from multiple environmental ...
Mikhail N. Zhizhin, Eric A. Kihn, Vassily Lyutsare...
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 5 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu