Sciweavers

840 search results - page 65 / 168
» Scalable Transfer Patterns
Sort
View
IBPRIA
2007
Springer
14 years 2 months ago
Parsimonious Kernel Fisher Discrimination
Abstract. By applying recent results in optimization transfer, a new algorithm for kernel Fisher Discriminant Analysis is provided that makes use of a non-smooth penalty on the coe...
Kitsuchart Pasupa, Robert F. Harrison, Peter Wille...
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 10 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 9 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
FPGA
2009
ACM
285views FPGA» more  FPGA 2009»
14 years 3 months ago
PERG-Rx: a hardware pattern-matching engine supporting limited regular expressions
PERG is a pattern matching engine designed for locating predefined byte string patterns (rules) from the ClamAV virus signature database in a data stream. This paper presents PERG...
Johnny Tsung Lin Ho, Guy G. Lemieux
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 10 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu