가야대학교 분성도서관
주메뉴
자료검색
- Home
- 상세정보
상세정보
부가기능
EFFICIENT FREQUENT SUBTREE MINING BEYOND FORESTS [electronic resource].
상세 프로파일
| 자료유형 | E-Book |
|---|---|
| 개인저자 | Welke, Pascal. |
| 서명/저자사항 | EFFICIENT FREQUENT SUBTREE MINING BEYOND FORESTS[electronic resource]. |
| 발행사항 | AMSTERDAM : IOS PRESS, 2020. |
| 형태사항 | 1 online resource |
| 소장본 주기 | OCLC control number change |
| ISBN | 164368079X 9781643680798 |
| 내용주기 | Intro -- Title Page -- Contents -- 1 Introduction -- 1.1 A Motivating Experiment -- 1.2 Contributions -- 1.3 Outline -- 1.4 Previously Published Work -- 2 Preliminaries -- 2.1 Notions and Notation -- 2.2 Frequent Connected Subgraph Mining -- 2.3 Embedding Computation -- 2.4 Datasets -- 3 Related Work -- 3.1 Algorithms for the SubgraphIsomorphism Problem -- 3.2 Algorithms for the FCSM Problem -- 4 Probabilistic Frequent Subtrees -- 4.1 Mining Probabilistic Frequent Subtrees -- 4.2 Experimental Evaluation -- 4.3 Summary -- 5 Boosted Probabilistic Frequent Subtrees 5.1 An Efficient Embedding Operator for Trees -- 5.2 Mining Boosted Probabilistic Frequent Subtrees -- 5.3 Exact Frequent Subtree Mining -- 5.4 Summary and Open Questions -- 6 Fast Computation -- 6.1 Complete Embeddings into Subtree Feature Spaces -- 6.2 Min-Hashing in Subtree Feature Spaces -- 6.3 Experimental Evaluation -- 6.4 Summary and Open Questions -- 7 Conclusion -- 7.1 Discussion -- 7.2 Outlook -- A HamiltonianPath for Cactus Graphs -- A.1 Three Necessary Conditions -- A.2 A Linear Time Algorithm for Cactus Graphs -- A.3 Some Statistics for Real-World Datasets -- A.4 Summary B Poissons Binomial Distribution -- Bibliography |
| 일반주제명 | Data mining. |
| 언어 | 영어 |
| 대출바로가기 | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2512584 |
소장정보
- 소장정보
인쇄
| No. | 등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
|---|---|---|---|---|---|---|---|---|
| 1 | WE00020333 | 006.3/12 | 가야대학교/전자책서버(컴퓨터서버)/ | 대출가능 |
|
카피라이터
