Sciweavers

321 search results - page 44 / 65
» Additive Pattern Database Heuristics
Sort
View
DSS
2007
226views more  DSS 2007»
14 years 9 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
15 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
15 years 4 months ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 2 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer