Sciweavers

1314 search results - page 181 / 263
» Approximate data mining in very large relational data
Sort
View
FLAIRS
2007
15 years 6 months ago
Low-Effort Labeling of Network Events for Intrusion Detection in WLANs
A low-effort data mining approach to labeling network event records in a WLAN is proposed. The problem being addressed is often observed in an AI and data mining strategy to netwo...
Taghi M. Khoshgoftaar, Chris Seiffert, Naeem Seliy...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 4 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
KDD
2012
ACM
166views Data Mining» more  KDD 2012»
13 years 7 months ago
Selecting a characteristic set of reviews
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
Theodoros Lappas, Mark Crovella, Evimaria Terzi
BMCBI
2008
85views more  BMCBI 2008»
15 years 4 months ago
SPSmart: adapting population based SNP genotype databases for fast and comprehensive web access
Background: In the last five years large online resources of human variability have appeared, notably HapMap, Perlegen and the CEPH foundation. These databases of genotypes with p...
Jorge Amigo, Antonio Salas, Christopher Phillips, ...
AVI
2008
15 years 5 months ago
Query-through-drilldown: data-oriented extensional queries
Traditional database query formulation is intensional: at the level of schemas, table and column names. Previous work has shown that filters can be created using a query paradigm ...
Alan J. Dix, Damon Oram