Sciweavers

2512 search results - page 302 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
148
Voted
BMCBI
2010
164views more  BMCBI 2010»
15 years 1 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
KDD
2005
ACM
107views Data Mining» more  KDD 2005»
15 years 9 months ago
Predicting the product purchase patterns of corporate customers
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
Bhavani Raskutti, Alan Herschtal
BMCBI
2010
113views more  BMCBI 2010»
15 years 4 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
ICDM
2010
IEEE
193views Data Mining» more  ICDM 2010»
15 years 2 months ago
Supervised Link Prediction Using Multiple Sources
Link prediction is a fundamental problem in social network analysis and modern-day commercial applications such as Facebook and Myspace. Most existing research approaches this pro...
Zhengdong Lu, Berkant Savas, Wei Tang, Inderjit S....
JMLR
2010
155views more  JMLR 2010»
15 years 2 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...