Sciweavers

653 search results - page 110 / 131
» The size of minimum 3-trees
Sort
View
DKE
2007
105views more  DKE 2007»
14 years 11 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
EAAI
2007
103views more  EAAI 2007»
14 years 11 months ago
Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
Ganesh K. Venayagamoorthy, Scott C. Smith, Gaurav ...
KAIS
2006
164views more  KAIS 2006»
14 years 11 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
IDA
2007
Springer
14 years 11 months ago
Anomaly detection in data represented as graphs
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
William Eberle, Lawrence B. Holder
SIMPRA
2008
125views more  SIMPRA 2008»
14 years 11 months ago
Identification of Wiener models using optimal local linear models
The Wiener model is a versatile nonlinear block oriented model structure for miscellaneous applications. In this paper a method for identifying the parameters of such a model usin...
Martin Kozek, Sabina Sinanovic