Sciweavers

15 search results - page 1 / 3
» Algorithms for Finding Attribute Value Group for Binary Segm...
Sort
View
TKDE
2002
141views more  TKDE 2002»
13 years 4 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
13 years 8 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 5 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
14 years 5 months ago
Detecting anomalous records in categorical datasets
We consider the problem of detecting anomalies in high arity categorical datasets. In most applications, anomalies are defined as data points that are 'abnormal'. Quite ...
Kaustav Das, Jeff G. Schneider
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
13 years 11 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan