449 search results - page 62 / 90 » Latent Structure Pattern Mining |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
As the amount of textual information grows explosively in various kinds of business systems, it becomes more and more desirable to analyze both structured data records and unstruc...
DATAMINE
2006
13 years 8 months ago
2006
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
KDD
2010
ACM
14 years 12 days ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
KDD
2012
ACM
11 years 11 months ago
2012
ACM
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...