Sciweavers

4072 search results - page 348 / 815
» Becoming Increasingly Reactive
Sort
View
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 7 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
180
Voted
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 7 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 7 months ago
Belief state approaches to signaling alarms in surveillance systems
Surveillance systems have long been used to monitor industrial processes and are becoming increasingly popular in public health and anti-terrorism applications. Most early detecti...
Kaustav Das, Andrew W. Moore, Jeff G. Schneider
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
16 years 7 months ago
Cluster-based concept invention for statistical relational learning
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
Alexandrin Popescul, Lyle H. Ungar