Sciweavers

1622 search results - page 201 / 325
» Learning a Hidden Matching
Sort
View
JMLR
2006
138views more  JMLR 2006»
15 years 3 months ago
Noisy-OR Component Analysis and its Application to Link Analysis
We develop a new component analysis framework, the Noisy-Or Component Analyzer (NOCA), that targets high-dimensional binary data. NOCA is a probabilistic latent variable model tha...
Tomás Singliar, Milos Hauskrecht
113
Voted
ML
2006
ACM
15 years 3 months ago
XRules: An effective algorithm for structural classification of XML data
Abstract XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining ...
Mohammed Javeed Zaki, Charu C. Aggarwal
115
Voted
TNN
2008
181views more  TNN 2008»
15 years 3 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
125
Voted
JCP
2007
86views more  JCP 2007»
15 years 3 months ago
Taking Multiple-Choise Quiz by SMS on Mobile Phones Including Analyzing Property
— Recently Mobile Learning (M-Learning) has attracted much attention. Due to advantages of SMS (Short Messaging Service) on mobile phones we present a safe and protected method f...
Mohammad Shirali-Shahreza
113
Voted
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 3 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre