Sciweavers

728 search results - page 15 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
ICDM
2007
IEEE
157views Data Mining» more  ICDM 2007»
13 years 9 months ago
Training Conditional Random Fields by Periodic Step Size Adaptation for Large-Scale Text Mining
For applications with consecutive incoming training examples, on-line learning has the potential to achieve a likelihood as high as off-line learning without scanning all availabl...
Han-Shen Huang, Yu-Ming Chang, Chun-Nan Hsu
SDM
2008
SIAM
117views Data Mining» more  SDM 2008»
13 years 9 months ago
A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
Yijun Sun, Sinisa Todorovic, Steve Goodison
SSDBM
1996
IEEE
168views Database» more  SSDBM 1996»
13 years 11 months ago
Data Mining: Machine Learning, Statistics, and Databases
Knowledge discovery in databases and data mining aim at semiautomatic tools for the analysis of large data sets. We give an overview of the area and present someof the research is...
Heikki Mannila
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 9 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount