Sciweavers

739 search results - page 144 / 148
» Approximate Association Rule Mining
Sort
View
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 11 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 9 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
IDA
2002
Springer
13 years 7 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
14 years 9 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri