DocumentCode
3471484
Title
A fuzzy similarity measure based on the centrality scores of fuzzy terms
Author
Meghabghab, George
Author_Institution
Dept. of Comput. Sci. Technol., Roane State, Oak Ridge, TN, USA
Volume
2
fYear
2004
fDate
27-30 June 2004
Firstpage
740
Abstract
The idea of bow tie graphs had generated interest in Web graphs, Web mining algorithms, and the study of hubs and authorities in Web graphs. A bow tie graph is a graph such that at the center of the bow tie is the knot, which is "the strongly connected core", the left bow consists of pages that eventually allow users to reach the core, but that cannot themselves be reached from the core, i.e., L, where L=(L1, L2 ,L3,....,Lm), and the right bow consists of "termination" pages that can be accessed via links from the core but that do not link back into the core, i.e., R where R=(R1, R2, R3.....,Rn) and where n is different from m. We use this idea to construct a new fuzzy similarity measure between 2 fuzzy concepts. We say that 2 fuzzy terms t1 and t2 are fuzzy ε(ε>=0) "bow tie similar" or "≅εBT" iff: t1≅εBT t2 iff |Ct1,t2| >=ε and |Ct2,t1| >=ε, where Cti,tj is the centrality score distribution of term t1 for term tj. A centrality score Ctj is defined iteratively as: (Cti)k =1 at k=0; (Ctj)k+1=Max(Min((B° (Ctj)k ° AT, BT ° (Ctj)k ° A ))/|| B ° (Cti)k ° AT + BT ° (Cti)k ° A)||, where, ° is the symbol of composition of 2 relations, T is the transpose of the mapping, || is an absolute value, B is a fuzzy relation on L×{t1,t2}, where L=(L1, L2, L3,.....,Lm), A is a fuzzy relation on {t1,t2} × R, where R=(R1, R2, R3,.....,Rn). Remember that the centrality score definition stems from the following observation on bow tie graphs: (L1, L2, L3, ....., Lm) is t1 & (L1, L2, L3, .....Lm) is t2 and t1 is (R1, R2, R3,.....Rn). Our fuzzy similarity measure is a new fuzzy similarity measure and was never used before. We study different kinds of fuzzy membership functions for the relation A and B. We apply our fuzzy similarity measure to different - terms that we picked from the dictionary at http://www.eleves.ens.fr/home/senellar/. We compare those results to existing non-fuzzy similarity measures. Our results show that similarity between terms based on fuzzy ε "bow tie similar" is a better similarity between terms than the equivalent non-fuzzy similarity measures.
Keywords
fuzzy set theory; graph theory; bow tie graphs; centrality score distribution; centrality scores; fuzzy membership functions; fuzzy similarity measure; fuzzy terms; Bipartite graph; Computer science; Dictionaries; Information filtering; Information filters; Web mining; Web pages;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Information, 2004. Processing NAFIPS '04. IEEE Annual Meeting of the
Print_ISBN
0-7803-8376-1
Type
conf
DOI
10.1109/NAFIPS.2004.1337394
Filename
1337394
Link To Document