Sciweavers

382 search results - page 46 / 77
» Multi-objective pattern and feature selection by a genetic a...
Sort
View
139
Voted
CIKM
2008
Springer
15 years 5 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
135
Voted
DIS
2010
Springer
15 years 1 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
132
Voted
BMCBI
2008
107views more  BMCBI 2008»
15 years 3 months ago
A machine learning approach to explore the spectra intensity pattern of peptides using tandem mass spectrometry data
Background: A better understanding of the mechanisms involved in gas-phase fragmentation of peptides is essential for the development of more reliable algorithms for high-throughp...
Cong Zhou, Lucas D. Bowler, Jianfeng Feng
CIDM
2007
IEEE
15 years 10 months ago
Mining Subspace Correlations
— In recent applications of clustering such as gene expression microarray analysis, collaborative filtering, and web mining, object similarity is no longer measured by physical ...
Rave Harpaz, Robert M. Haralick
135
Voted
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 4 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...