Sciweavers

692 search results - page 102 / 139
» A new clustering algorithm for coordinate-free data
Sort
View
ICTAI
2003
IEEE
14 years 1 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
CIDR
2011
234views Algorithms» more  CIDR 2011»
12 years 11 months ago
SWissBox: An Architecture for Data Processing Appliances
Database appliances offer fully integrated hardware, storage, operating system, database, and related software in a single package. Database appliances have a relatively long hist...
Gustavo Alonso, Donald Kossmann, Timothy Roscoe
BMCBI
2010
243views more  BMCBI 2010»
13 years 8 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
ICML
1994
IEEE
13 years 11 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
13 years 6 months ago
Discovering Temporal Features and Relations of Activity Patterns
An important problem that arises during the data mining process in many new emerging application domains is mining data with temporal dependencies. One such application domain is a...
Ehsan Nazerfard, Parisa Rashidi, Diane J. Cook