Sciweavers

2705 search results - page 277 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
16 years 1 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
DKE
2007
82views more  DKE 2007»
15 years 6 months ago
Eliciting information for product modeling using process modeling
A product model is a formal and structured definition of product information. The most common procedure for defining a product data model is to first describe the business and/...
Ghang Lee, Charles M. Eastman, Rafael Sacks
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
16 years 1 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
WWW
2004
ACM
16 years 7 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien