Sciweavers

2705 search results - page 368 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
KDD
1994
ACM
113views Data Mining» more  KDD 1994»
15 years 10 months ago
Exploration of Simulation Experiments by Discovery
: Weexemplify in this paper, howa discovery system is applied to the analysis of simulation experimentsin practical political planning, andshowwhatkind of newknowledgecan be discov...
Willi Klösgen
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 6 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
CLA
2004
15 years 7 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata
AAAI
2000
15 years 7 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
WWW
2010
ACM
16 years 1 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney