SlideShare a Scribd company logo
NIPS-2010
                                       @



           • b-bit Minwise Hashing for Estimating Three-
                Way Similarities. P. Li et al.

                •
           • Functional Geometry Alignment and
                Localization of Brain Areas. Langs et al.

                •
2011   2   14
b-bit Minwise Hashing for
        Estimating Three-Way
               Similarities

                • Minwise Hashing (MinHash)   ?

                • b-bit Minwise Hasing    ?




2011   2   14
Motivation
       •
            •              ,
            •
            •                          Web
            •
            •
       •                       2   (               )
       •               Minwise Hasing (MinHash) [Broder 1997]
                sign random projections (simhash) Hamming
                Distance LSH
2011   2   14
Minwise Hashing
       •                 Jaccard
                                                            |A ∩ B|
                                                  J(A, B) =
                                                            |A ∪ B|
       •
       •        Random parmutation (or Hash        ) π(x)
       •             A             π(x)        Pr[min(π(A)) = min(π(B))]
                Pr[min(π(A)) = min(π(B))] = J(A, B)

       •             A = {1, 3, 5, 7}, B = {3, 4, 5}
                       ⇒ A ∩ B = {3, 5}, A ∪ B = {1, 3, 4, 5, 7}
           •      min(h(A)) = min(h(B))                     {1,3,4,5,7}
                                     3    5
                 •   Jaccard

2011   2   14
•




           •
                                Hash                       bit


                •   Altavista                             40bit Fetterly
                    WWW03          64bit

           •                           Hash   1 or 2bit

           •
2011   2   14
•                 2
                    •
                    •   Jaccard       (0.5   )




2011   2   14
• b-Bit Minwise Hashing for Estimating
                    Three-Way Similarities NIPS2010

                • b-Bit Minwise Hashing   3
                    Jaccard
                                    |A ∩ B ∩ C|
                       J(A, B, C) =
                                    |A ∪ B ∪ C|

                •
2011   2   14
Functional Geometry Alignment
             and Localization of Brain Areas
                                 Registration based on anatomical data   Registration based on the function




                                  brain 1    registration    brain 2       brain 1   embedding           re


                                 Figure 1: Standard anatomical registration and the proposed fun
mical data     Registration basedtional geometry geometry matches the diffusion maps of fMRI
                                  on the functional alignment




                            Integrating functional features into the registration process prom
brain 2        brain 1 embedding proposed methods match the centers of activated cortica
                            cently       registration       embedding brain 2
                            correspondences of cortical surfaces [18]. The fMRI signals at t
                            vector, and registration is performed by maximizing the inter-su
mical2 registration and the proposed functional geometry alignment. Func- warp to
  2011  14
                            points, while at the same time regularizing the surface
Motivation
       •
       •                    fMRI


       •
            •
                                                  ?


                      Above-threshold region in       Above-threshold region in
2011   2   14         source subject                  target subject
• fMRI
       • Voxel                               (           Kernel)


       • Diffusion Maps
       •              Voxel

                a. Maps of two subjects




                                  s0             Ψ0          Ψ1        s1
                                Subject 1        Map 1       Map 2   Subject 2



2011   2   14   b. Aligning the point sets
Diffusion Maps
       •    Coifman and Lafon. Applied and Comp. Harmonic Analysis. 2006
       •                    PCA      Isomap
       •    Spectral Clustering

                                  •
                                  •         i,j     t                  i   Markov
                                          chain random walk        t


                                      •    Normalized Graph Laplacian
                                  •
                                          Diffusion Distance
                                  •       Diffusion Distance
                                                     N   (N    )

2011   2   14
a. Maps of two subjects




                             s0                          Ψ0                        Ψ1             s1
                           Subject 1                     Map 1                    Map 2         Subject 2



           b. Aligning the point sets

                                                                 xk
                                                                  0
                                                                          xl
                                                                           1

                                                                                                                          A.



                                                                                                                    FGA
                                                                                                            0.2
                                                                                                              0.2



                                                                      ?
       Figure 2: Maps of two subjects in the process of registration: (a) Left and right: the0.15  axial and
                                                                                               0.15
       sagittal views of the points in the two brains. The two central columns show plots of the first
       three dimensions of the embedding in the functional geometry after coarse rotational alignment. (b)
       During alignment, a maps is represented as a Gaussian mixture model. The colors in both plots
       indicate clusters which are only region in visualization. Above-threshold region in
                          Above-threshold used for                                              0.1
                                                                                                  0.1


2011   2    14                          source subject                         target subject
2011   2   14

More Related Content

PDF
Modern features-part-4-evaluation
PDF
Moving Cast Shadow Detection Using Physics-based Features (CVPR 2009)
PDF
Bi-Point-Determining Graphs
PDF
改进的固定点图像复原算法_英文_阎雪飞
PDF
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
PDF
Lecture29
PDF
2_IGARSS2011_BPT_v2.pdf
PDF
GECCO 2009 BBOB Workshop
Modern features-part-4-evaluation
Moving Cast Shadow Detection Using Physics-based Features (CVPR 2009)
Bi-Point-Determining Graphs
改进的固定点图像复原算法_英文_阎雪飞
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
Lecture29
2_IGARSS2011_BPT_v2.pdf
GECCO 2009 BBOB Workshop

More from sesejun (20)

PDF
RNAseqによる変動遺伝子抽出の統計: A Review
PDF
バイオインフォマティクスによる遺伝子発現解析
PDF
次世代シーケンサが求める機械学習
PDF
20110602labseminar pub
PDF
20110524zurichngs 2nd pub
PDF
20110524zurichngs 1st pub
PDF
Datamining 9th association_rule.key
PDF
Datamining 8th hclustering
PDF
Datamining r 4th
PDF
Datamining r 3rd
PDF
Datamining r 2nd
PDF
Datamining r 1st
PDF
Datamining 6th svm
PDF
Datamining 5th knn
PDF
Datamining 4th adaboost
PDF
Datamining 3rd naivebayes
PDF
Datamining 2nd decisiontree
PDF
Datamining 7th kmeans
PDF
100401 Bioinfoinfra
PDF
Datamining 8th Hclustering
RNAseqによる変動遺伝子抽出の統計: A Review
バイオインフォマティクスによる遺伝子発現解析
次世代シーケンサが求める機械学習
20110602labseminar pub
20110524zurichngs 2nd pub
20110524zurichngs 1st pub
Datamining 9th association_rule.key
Datamining 8th hclustering
Datamining r 4th
Datamining r 3rd
Datamining r 2nd
Datamining r 1st
Datamining 6th svm
Datamining 5th knn
Datamining 4th adaboost
Datamining 3rd naivebayes
Datamining 2nd decisiontree
Datamining 7th kmeans
100401 Bioinfoinfra
Datamining 8th Hclustering
Ad

Recently uploaded (20)

PDF
Bridging biosciences and deep learning for revolutionary discoveries: a compr...
PDF
Diabetes mellitus diagnosis method based random forest with bat algorithm
PDF
Mobile App Security Testing_ A Comprehensive Guide.pdf
PDF
Encapsulation theory and applications.pdf
PDF
Network Security Unit 5.pdf for BCA BBA.
PPTX
Cloud computing and distributed systems.
PDF
NewMind AI Monthly Chronicles - July 2025
PDF
Unlocking AI with Model Context Protocol (MCP)
PDF
Chapter 3 Spatial Domain Image Processing.pdf
PDF
KodekX | Application Modernization Development
PDF
Architecting across the Boundaries of two Complex Domains - Healthcare & Tech...
PPTX
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
PDF
How UI/UX Design Impacts User Retention in Mobile Apps.pdf
PDF
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
PDF
Shreyas Phanse Resume: Experienced Backend Engineer | Java • Spring Boot • Ka...
PDF
Encapsulation_ Review paper, used for researhc scholars
PPTX
VMware vSphere Foundation How to Sell Presentation-Ver1.4-2-14-2024.pptx
PPTX
PA Analog/Digital System: The Backbone of Modern Surveillance and Communication
PDF
Empathic Computing: Creating Shared Understanding
PPT
“AI and Expert System Decision Support & Business Intelligence Systems”
Bridging biosciences and deep learning for revolutionary discoveries: a compr...
Diabetes mellitus diagnosis method based random forest with bat algorithm
Mobile App Security Testing_ A Comprehensive Guide.pdf
Encapsulation theory and applications.pdf
Network Security Unit 5.pdf for BCA BBA.
Cloud computing and distributed systems.
NewMind AI Monthly Chronicles - July 2025
Unlocking AI with Model Context Protocol (MCP)
Chapter 3 Spatial Domain Image Processing.pdf
KodekX | Application Modernization Development
Architecting across the Boundaries of two Complex Domains - Healthcare & Tech...
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
How UI/UX Design Impacts User Retention in Mobile Apps.pdf
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
Shreyas Phanse Resume: Experienced Backend Engineer | Java • Spring Boot • Ka...
Encapsulation_ Review paper, used for researhc scholars
VMware vSphere Foundation How to Sell Presentation-Ver1.4-2-14-2024.pptx
PA Analog/Digital System: The Backbone of Modern Surveillance and Communication
Empathic Computing: Creating Shared Understanding
“AI and Expert System Decision Support & Business Intelligence Systems”
Ad

20110214nips2010 read

  • 1. NIPS-2010 @ • b-bit Minwise Hashing for Estimating Three- Way Similarities. P. Li et al. • • Functional Geometry Alignment and Localization of Brain Areas. Langs et al. • 2011 2 14
  • 2. b-bit Minwise Hashing for Estimating Three-Way Similarities • Minwise Hashing (MinHash) ? • b-bit Minwise Hasing ? 2011 2 14
  • 3. Motivation • • , • • Web • • • 2 ( ) • Minwise Hasing (MinHash) [Broder 1997] sign random projections (simhash) Hamming Distance LSH 2011 2 14
  • 4. Minwise Hashing • Jaccard |A ∩ B| J(A, B) = |A ∪ B| • • Random parmutation (or Hash ) π(x) • A π(x) Pr[min(π(A)) = min(π(B))] Pr[min(π(A)) = min(π(B))] = J(A, B) • A = {1, 3, 5, 7}, B = {3, 4, 5} ⇒ A ∩ B = {3, 5}, A ∪ B = {1, 3, 4, 5, 7} • min(h(A)) = min(h(B)) {1,3,4,5,7} 3 5 • Jaccard 2011 2 14
  • 5. • Hash bit • Altavista 40bit Fetterly WWW03 64bit • Hash 1 or 2bit • 2011 2 14
  • 6. 2 • • Jaccard (0.5 ) 2011 2 14
  • 7. • b-Bit Minwise Hashing for Estimating Three-Way Similarities NIPS2010 • b-Bit Minwise Hashing 3 Jaccard |A ∩ B ∩ C| J(A, B, C) = |A ∪ B ∪ C| • 2011 2 14
  • 8. Functional Geometry Alignment and Localization of Brain Areas Registration based on anatomical data Registration based on the function brain 1 registration brain 2 brain 1 embedding re Figure 1: Standard anatomical registration and the proposed fun mical data Registration basedtional geometry geometry matches the diffusion maps of fMRI on the functional alignment Integrating functional features into the registration process prom brain 2 brain 1 embedding proposed methods match the centers of activated cortica cently registration embedding brain 2 correspondences of cortical surfaces [18]. The fMRI signals at t vector, and registration is performed by maximizing the inter-su mical2 registration and the proposed functional geometry alignment. Func- warp to 2011 14 points, while at the same time regularizing the surface
  • 9. Motivation • • fMRI • • ? Above-threshold region in Above-threshold region in 2011 2 14 source subject target subject
  • 10. • fMRI • Voxel ( Kernel) • Diffusion Maps • Voxel a. Maps of two subjects s0 Ψ0 Ψ1 s1 Subject 1 Map 1 Map 2 Subject 2 2011 2 14 b. Aligning the point sets
  • 11. Diffusion Maps • Coifman and Lafon. Applied and Comp. Harmonic Analysis. 2006 • PCA Isomap • Spectral Clustering • • i,j t i Markov chain random walk t • Normalized Graph Laplacian • Diffusion Distance • Diffusion Distance N (N ) 2011 2 14
  • 12. a. Maps of two subjects s0 Ψ0 Ψ1 s1 Subject 1 Map 1 Map 2 Subject 2 b. Aligning the point sets xk 0 xl 1 A. FGA 0.2 0.2 ? Figure 2: Maps of two subjects in the process of registration: (a) Left and right: the0.15 axial and 0.15 sagittal views of the points in the two brains. The two central columns show plots of the first three dimensions of the embedding in the functional geometry after coarse rotational alignment. (b) During alignment, a maps is represented as a Gaussian mixture model. The colors in both plots indicate clusters which are only region in visualization. Above-threshold region in Above-threshold used for 0.1 0.1 2011 2 14 source subject target subject
  • 13. 2011 2 14