Sciweavers

160 search results - page 32 / 32
» Mining frequent geographic patterns with knowledge constrain...
Sort
View
ISMIS
2009
Springer
13 years 11 months ago
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
Loïc Cerf, Tran Bao Nhan Nguyen, Jean-Fran&cc...
KAIS
2007
75views more  KAIS 2007»
13 years 5 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
13 years 8 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
SDM
2012
SIAM
305views Data Mining» more  SDM 2012»
11 years 7 months ago
Learning Hierarchical Relationships among Partially Ordered Objects with Heterogeneous Attributes and Links
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
Chi Wang, Jiawei Han, Qi Li, Xiang Li, Wen-Pin Lin...
AIIA
2005
Springer
13 years 10 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut