Sciweavers

84 search results - page 12 / 17
» Finding Representative Association Rules from Large Rule Col...
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 1 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
CCCG
2008
13 years 9 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...
PKDD
2005
Springer
110views Data Mining» more  PKDD 2005»
14 years 1 months ago
k-Anonymous Patterns
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in orde...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
ESANN
2004
13 years 9 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li