Sciweavers

21 search results - page 4 / 5
» Efficient L1 Regularized Logistic Regression
Sort
View
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 3 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
BMCBI
2010
150views more  BMCBI 2010»
13 years 2 months ago
Kernel based methods for accelerated failure time model with ultra-high dimensional data
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
Zhenqiu Liu, Dechang Chen, Ming Tan, Feng Jiang, R...
AAAI
2008
13 years 7 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
WWW
2010
ACM
14 years 5 days ago
Relational duality: unsupervised extraction of semantic relations between entities on the web
Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction, relation de...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
MICCAI
2008
Springer
14 years 6 months ago
Segmenting Brain Tumors Using Pseudo-Conditional Random Fields
Locating Brain tumor segmentation within MR (magnetic resonance) images is integral to the treatment of brain cancer. This segmentation task requires classifying each voxel as eith...
Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matt...