128 search results - page 25 / 26 » On Mining Closed Sets in Multi-Relational Data |
WSDM
2010
ACM
15 years 8 months ago
2010
ACM
Web 2.0 applications have attracted a considerable amount of attention because their open-ended nature allows users to create lightweight semantic scaffolding to organize and shar...
185
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
107
click to vote
MM
2006
ACM
15 years 5 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
112
click to vote
ICDM
2009
IEEE
15 years 5 months ago
2009
IEEE
—Typical information extraction (IE) systems can be seen as tasks assigning labels to words in a natural language sequence. The performance is restricted by the availability of l...
IJFCS
2008
14 years 11 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...