Sciweavers

1599 search results - page 173 / 320
» Theoretical Frameworks for Data Mining
Sort
View
IRI
2005
IEEE
14 years 2 months ago
Handling missing values via decomposition of the conditioned set
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
Mei-Ling Shyu, Indika Kuruppu-Appuhamilage, Shu-Ch...
CIDM
2007
IEEE
14 years 1 months ago
An Efficient Distance Calculation Method for Uncertain Objects
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
Lurong Xiao, Edward Hung
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 3 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 4 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
14 years 3 months ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh