Sciweavers

1314 search results - page 77 / 263
» Approximate data mining in very large relational data
Sort
View
CLA
2006
15 years 3 months ago
Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
The paper presents additional results on factorization by similarity of fuzzy concept lattices. A fuzzy concept lattice is a hierarchically ordered collection of clusters extracted...
Radim Belohlávek, Jan Outrata, Vilém...
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 3 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
KDD
2012
ACM
226views Data Mining» more  KDD 2012»
13 years 4 months ago
TourViz: interactive visualization of connection pathways in large graphs
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
Duen Horng Chau, Leman Akoglu, Jilles Vreeken, Han...
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 5 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
ICDE
2001
IEEE
104views Database» more  ICDE 2001»
16 years 3 months ago
Efficient Bulk Deletes in Relational Databases
Many applications require that large amounts of data are deleted from the database ? typically, such bulk deletes are carried out periodically and involve old or out-of-date data....
Andreas Gärtner, Alfons Kemper, Donald Kossma...