Sciweavers

728 search results - page 121 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
14 years 8 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
KDD
2008
ACM
164views Data Mining» more  KDD 2008»
14 years 8 months ago
Microscopic evolution of social networks
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
BMCBI
2011
13 years 2 months ago
Learning genetic epistasis using Bayesian network scoring criteria
Background: Gene-gene epistatic interactions likely play an important role in the genetic basis of many common diseases. Recently, machine-learning and data mining methods have be...
Xia Jiang, Richard E. Neapolitan, M. Michael Barma...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
SAC
2008
ACM
13 years 7 months ago
A clustering-based approach for discovering interesting places in trajectories
Because of the large amount of trajectory data produced by mobile devices, there is an increasing need for mechanisms to extract knowledge from this data. Most existing works have...
Andrey Tietbohl Palma, Vania Bogorny, Bart Kuijper...