Sciweavers

1601 search results - page 141 / 321
» Closed Sets for Labeled Data
Sort
View
UAI
2003
15 years 7 months ago
On Information Regularization
We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov styl...
Adrian Corduneanu, Tommi Jaakkola
JMLR
2010
230views more  JMLR 2010»
15 years 1 months ago
Learning Dissimilarities for Categorical Symbols
In this paper we learn a dissimilarity measure for categorical data, for effective classification of the data points. Each categorical feature (with values taken from a finite set...
Jierui Xie, Boleslaw K. Szymanski, Mohammed J. Zak...
DISCEX
2003
IEEE
15 years 11 months ago
Detecting Novel Scans Through Pattern Anomaly Detection
We introduce a technique for detecting anomalous patterns in a categorical feature (one that takes values from a finite alphabet). It differs from most anomaly detection methods u...
Alfonso Valdes
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 10 months ago
Reporting Flock Patterns
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data...
Marc Benkert, Joachim Gudmundsson, Florian Hü...
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 10 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg