1215 search results - page 79 / 243 » Numbers in Multi-relational Data Mining |
164
click to vote
IWPC
2006
IEEE
15 years 10 months ago
2006
IEEE
Software system analysis for extracting system functionality remains as a major problem in the reverse engineering literature and the early approaches mainly rely on static proper...
137
click to vote
FIMI
2004
15 years 6 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
136
Voted
ICDM
2009
IEEE
15 years 2 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
144
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
130
Voted
PAKDD
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...