Sciweavers

25 search results - page 2 / 5
» Mining non-redundant high order correlations in binary data
Sort
View
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 2 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
CCGRID
2010
IEEE
13 years 6 months ago
High Performance Dimension Reduction and Visualization for Large High-Dimensional Data Analysis
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
Jong Youl Choi, Seung-Hee Bae, Xiaohong Qiu, Geoff...
IJCNN
2006
IEEE
13 years 11 months ago
SOM-Based Sparse Binary Encoding for AURA Classifier
—The AURA k-Nearest Neighbour classifier associates binary input and output vectors, forming a compact binary Correlation Matrix Memory (CMM). For a new input vector, matching ve...
Simon O'Keefe
BMCBI
2006
169views more  BMCBI 2006»
13 years 4 months ago
Finding biological process modifications in cancer tissues by mining gene expression correlations
Background: Through the use of DNA microarrays it is now possible to obtain quantitative measurements of the expression of thousands of genes from a biological sample. This techno...
Giacomo Gamberoni, Sergio Storari, Stefano Volinia
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
13 years 11 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak