ICML 2007 - PDF Preprint Papers

ICML 2007 Workshop on Statistical Network Analysis

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICML-2007 Paper

click to vote

ICML
2007
IEEE

384views Machine Learning» more ICML 2007»

Discriminant analysis in correlation similarity measure space

15 years 7 days ago

Download www.machinelearning.org

Correlation is one of the most widely used similarity measures in machine learning like Euclidean and Mahalanobis distances. However, compared with proposed numerous discriminant ...

Yong Ma, Shihong Lao, Erina Takikawa, Masato Kawad...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	384	Discriminant analysis in correlation similarity measure space	claim
2	275	Pegasos: Primal Estimated sub-GrAdient SOlver for SVM	claim
3	250	Discriminative Gaussian process latent variable model for classification	claim
4	238	Learning from interpretations: a rooted kernel for ordered hypergraphs	claim
5	209	Multifactor Gaussian process models for style-content separation	claim
6	206	Nonmyopic active learning of Gaussian processes: an exploration-exploitation approach	claim
7	206	Scalable modeling of real graphs using Kronecker multiplication	claim
8	204	A dependence maximization view of clustering	claim
9	204	Constructing basis functions from directed graphs for value function approximation	claim
10	202	Cross-domain transfer for reinforcement learning	claim
11	200	Multi-task reinforcement learning: a hierarchical Bayesian approach	claim
12	197	A permutation-augmented sampler for DP mixture models	claim
13	194	Dynamic hierarchical Markov random fields and their application to web data extraction	claim
14	188	Multi-task learning for sequential data via iHMMs and the nested Dirichlet process	claim
15	188	Learning nonparametric kernel matrices from pairwise constraints	claim
16	185	Hierarchical Gaussian process latent variable models	claim
17	184	Non-isometric manifold learning: analysis and an algorithm	claim
18	184	Adaptive mesh compression in 3D computer graphics using multiscale manifold learning	claim
19	180	Tracking value function dynamics to improve reinforcement learning with piecewise linear function approximation	claim
20	180	Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps	claim
21	180	Bayesian actor-critic algorithms	claim
22	179	Bottom-up learning of Markov logic network structure	claim
23	179	A kernel path algorithm for support vector machines	claim
24	172	Conditional random fields for multi-agent reinforcement learning	claim
25	172	Dirichlet aggregation: unsupervised learning towards an optimal metric for proportional data	claim
26	171	Percentile optimization in uncertain Markov decision processes with application to efficient exploration	claim
27	170	Dimensionality reduction and generalization	claim
28	170	Self-taught learning: transfer learning from unlabeled data	claim
29	170	Transductive support vector machines for structured variables	claim
30	169	Information-theoretic metric learning	claim
31	169	Cluster analysis of heterogeneous rank data	claim
32	169	Piecewise pseudolikelihood for efficient training of conditional random fields	claim
33	166	A recursive method for discriminative mixture learning	claim
34	166	Sparse eigen methods by D.C. programming	claim
35	166	Simple, robust, scalable semi-supervised learning via expectation regularization	claim
36	166	Discriminant kernel and regularization parameter learning via semidefinite programming	claim
37	166	Online kernel PCA with entropic matrix updates	claim
38	166	Classifying matrices with a spectral regularization	claim
39	165	Modeling changing dependency structure in multivariate time series	claim
40	165	Bayesian compressive sensing and projection optimization	claim
41	165	Graph clustering with network structure indices	claim
42	163	Learning random walks to rank nodes in graphs	claim
43	163	Analyzing feature generation for value-function approximation	claim
44	162	Robust mixtures in the presence of measurement errors	claim
45	162	Automatic shaping and decomposition of reward functions	claim
46	162	Restricted Boltzmann machines for collaborative filtering	claim
47	160	Learning distance function by coding similarity	claim
48	160	A transductive framework of distance metric learning by spectral dimensionality reduction	claim
49	160	Transductive regression piloted by inter-manifold relations	claim
50	159	A novel orthogonal NMF-based belief compression for POMDPs	claim
51	159	Asymmetric boosting	claim
52	158	A bound on the label complexity of agnostic active learning	claim
53	157	Full regularization path for sparse principal component analysis	claim
54	157	Learning a meta-level prior for feature relevance from multiple related tasks	claim
55	156	Boosting for transfer learning	claim
56	156	An integrated approach to feature invention and model construction for drug activity prediction	claim
57	156	Neighbor search with global geometry: a minimax message passing algorithm	claim
58	154	Structural alignment based kernels for protein structure classification	claim
59	153	Comparisons of sequence labeling algorithms and extensions	claim
60	153	Approximate maximum margin algorithms with rules controlled by the number of mistakes	claim
61	149	Maximum margin clustering made practical	claim
62	148	Least squares linear discriminant analysis	claim
63	147	Solving multiclass support vector machines with LaRank	claim
64	147	Adaptive dimension reduction using discriminant analysis and K-means clustering	claim
65	146	Best of both: a hybridized centroid-medoid clustering heuristic	claim
66	146	Mixtures of hierarchical topics with Pachinko allocation	claim
67	146	Beamforming using the relevance vector machine	claim
68	145	Sample compression bounds for decision trees	claim
69	144	Three new graphical models for statistical language modelling	claim
70	142	Learning to combine distances for complex representations	claim
71	142	Discriminative learning for differing training and test distributions	claim
72	141	Minimum reference set based feature selection for small sample classifications	claim
73	141	Exponentiated gradient algorithms for log-linear structured prediction	claim
74	141	CarpeDiem: an algorithm for the fast evaluation of SSL classifiers	claim
75	141	Reinforcement learning by reward-weighted regression for operational space control	claim
76	141	On the role of tracking in stationary environments	claim
77	139	Learning state-action basis functions for hierarchical MDPs	claim
78	139	Most likely heteroscedastic Gaussian process regression	claim
79	139	Multi-armed bandit problems with dependent arms	claim
80	138	On learning with dissimilarity functions	claim
81	137	Regression on manifolds using kernel dimension reduction	claim
82	136	On the value of pairwise constraints in classification and consistency	claim
83	136	Combining online and offline knowledge in UCT	claim
84	135	Gradient boosting for kernelized output spaces	claim
85	134	Learning to rank: from pairwise approach to listwise approach	claim
86	134	More efficiency in multiple kernel learning	claim
87	133	The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks	claim
88	133	Winnowing subspaces	claim
89	132	Local learning projections	claim
90	132	Sparse probabilistic classifiers	claim
91	130	Map building without localization by dimensionality reduction techniques	claim
92	129	Hierarchical maximum entropy density estimation	claim
93	128	Incremental Bayesian networks for structure prediction	claim
94	127	Nonlinear independent component analysis with minimal nonlinear distortion	claim
95	127	Efficiently computing minimax expected-size confidence regions	claim
96	126	Fast and effective kernels for relational learning from texts	claim
97	126	Hybrid huberized support vector machines for microarray classification	claim
98	125	Parameter learning for relational Bayesian networks	claim
99	125	Recovering temporally rewiring networks: a model-based approach	claim
100	124	Focused crawling with scalable ordinal regression solvers	claim
101	124	Experimental perspectives on learning from imbalanced data	claim
102	123	Optimal dimensionality of metric space for classification	claim
103	123	Local dependent components	claim
104	122	Asymptotic Bayesian generalization error when training and test distributions are different	claim
105	122	Spectral clustering and transductive learning with multiple views	claim
106	121	On learning linear ranking functions for beam search	claim
107	121	Statistical predicate invention	claim
108	121	Manifold-adaptive dimension estimation	claim
109	120	Entire regularization paths for graph data	claim
110	119	Scalable training of L1-regularized log-linear models	claim
111	119	Relational clustering by symmetric convex coding	claim
112	119	What is decreased by the max-sum arc consistency algorithm?	claim
113	118	Simpler core vector machines with enclosing balls	claim
114	118	Magnitude-preserving ranking algorithms	claim
115	118	Infinite mixtures of trees	claim
116	117	Large-scale RLSC learning without agony	claim
117	117	Supervised feature selection via dependence estimation	claim
118	117	Robust multi-task learning with t-processes	claim
119	117	Direct convex relaxations of sparse SVM	claim
120	116	The matrix stick-breaking process for flexible multi-task learning	claim
121	115	Trust region Newton methods for large-scale logistic regression	claim
122	115	Multiclass multiple kernel learning	claim
123	115	Local similarity discriminant analysis	claim
124	113	Quantum clustering algorithms	claim
125	113	Kernelizing PLS, degrees of freedom, and efficient model selection	claim
126	112	Uncovering shared structures in multiclass classification	claim
127	112	Efficient inference with cardinality-based clique potentials	claim
128	110	Unsupervised estimation for noisy-channel models	claim
129	109	A fast linear separability test by projection of positive points on subspaces	claim
130	109	A kernel-based causal learning algorithm	claim
131	108	Unsupervised prediction of citation influences	claim
132	107	Online discovery of similarity mappings	claim
133	107	Quadratically gated mixture of experts for incomplete data classification	claim
134	107	Learning to compress images and videos	claim
135	106	Linear and nonlinear generative probabilistic class models for shape contours	claim
136	106	Multiclass core vector machine	claim
137	105	Spectral feature selection for supervised and unsupervised learning	claim
138	104	On one method of non-diagonal regularization in sparse Bayesian learning	claim
139	104	Learning for efficient retrieval of structured data with noisy queries	claim
140	102	Feature selection in a kernel space	claim
141	102	An empirical evaluation of deep architectures on problems with many factors of variation	claim
142	101	Intractability and clustering with constraints	claim
143	98	Support cluster machine	claim
144	97	On the relation between multi-instance learning and semi-supervised learning	claim
145	97	Two-view feature generation model for semi-supervised learning	claim
146	95	Revisiting probabilistic models for clustering with pair-wise constraints	claim
147	94	Supervised clustering of streaming data for email batch detection	claim
148	88	Multiple instance learning for sparse positive bags	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers