[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2003-10 | ||
| Submitted on | 17th of February 2003 | ||
| Author | Jeh, Glen; Widom, Jennifer | ||
| Title | Mining the Space of Graph Properties | ||
| Date of publication | February 2003 | ||
| Citation | Jeh, Glen; Widom, Jennifer. Mining the Space of Graph Properties, Technical Report, Stanford University Database Group | ||
| Number of pages | 12 | ||
| Language | English | ||
| Project | Database Group | ||
| Type | Technical Report | ||
| Subject group | Data Mining | ||
| Abstract | Existing data mining algorithms on graphs look for nodes satisfying specific properties, such as specific notions of structural similarity or specific measures of link-based importance. While such analyses for predetermined properties can be effective in well-understood domains, sometimes identifying an appropriate property for analysis can be a challenge, and focusing on a single property may neglect other important aspects of the data. In this paper, we develop a foundation for mining the properties themselves. We present a theoretical framework defining the space of graph properties, a variety of mining queries enabled by the framework, techniques to handle the enormous size of the query space, and an experimental system called "F-Miner" that demonstrates the utility and feasibility of property mining. | ||
| Keywords | data mining, graph mining | ||
| Contact address | glenj@cs.stanford.edu | ||
| Sponsored by | National Science Foundation under grant IIS-9817799. | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]