Sciweavers

878 search results - page 96 / 176
» Modeling Relational Data as Graphs for Mining
Sort
View
AUSAI
2007
Springer
15 years 11 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
164
Voted
IWCIA
2009
Springer
15 years 11 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
WWW
2008
ACM
16 years 5 months ago
Mining for personal name aliases on the web
We propose a novel approach to find aliases of a given name from the web. We exploit a set of known names and their aliases as training data and extract lexical patterns that conv...
Danushka Bollegala, Taiki Honma, Yutaka Matsuo, Mi...
EDM
2009
147views Data Mining» more  EDM 2009»
15 years 2 months ago
Using Dirichlet priors to improve model parameter plausibility
Student modeling is a widely used approach to make inference about a student's attributes like knowledge, learning, etc. If we wish to use these models to analyze and better u...
Dovan Rai, Yue Gong, Joseph Beck
SDM
2011
SIAM
233views Data Mining» more  SDM 2011»
14 years 7 months ago
Multi-Instance Mixture Models
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
James R. Foulds, Padhraic Smyth