404 search results - page 67 / 81 » Structure Discovery from Sequential Data |
JPDC
2008
14 years 9 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
AUSDM
2007
Springer
15 years 3 months ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
DASFAA
2005
IEEE
2005
IEEE
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
15 years 3 months ago
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
99
Voted
SCCC
2000
IEEE
15 years 2 months ago
2000
IEEE
Knowledge discovery is the most desirable end product of an enterprise information system. Researches from different areas recognize that a new generation of intelligent tools for...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...