Sciweavers

7581 search results - page 1198 / 1517
» Incompleteness in Data Mining
Sort
View
158
Voted
IPL
2006
99views more  IPL 2006»
15 years 6 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
JUCS
2008
107views more  JUCS 2008»
15 years 6 months ago
Informatics for Historians: Tools for Medieval Document XML Markup, and their Impact on the History-Sciences
: This article is a revised and extended version of [VBG, 07]. We conjecture that the digitalization of historical text documents as a basis of data mining and information retrieva...
Benjamin Burkard, Georg Vogeler, Stefan Gruner
TKDE
2008
152views more  TKDE 2008»
15 years 6 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
TIT
2002
96views more  TIT 2002»
15 years 6 months ago
An axiomatization of partition entropy
Abstract-- The aim of this paper is to present an axiomatization of a generalization of Shannon's entropy starting from partitions of finite sets. The proposed axiomatization ...
Dan A. Simovici, Szymon Jaroszewicz
KES
2010
Springer
15 years 5 months ago
Visualization of Text Streams: A Survey
— This work presents related areas of research, types of data collections that are visualized, technical aspects of generating visualizations, and evaluation methodologies. Exist...
Artur Silic, Bojana Dalbelo Basic
« Prev « First page 1198 / 1517 Last » Next »