P-FCM: a proximity-based fuzzy clustering. (English) Zbl 1071.68541

Summary: We introduce and study a proximity-based fuzzy clustering. As the name stipulates, in this mode of clustering, a structure “discovery” in the data is realized in an unsupervised manner and becomes augmented by a certain auxiliary supervision mechanism. The supervision mechanism introduced in this algorithm is realized via a number of proximity “hints” (constraints) that specify an extent to which some pairs of patterns are regarded similar or different. They are provided externally to the clustering algorithm and help in the navigation of the search through the set of patterns and this gives rise to a two-phase optimization process. Its first phase is the standard FCM while the second step is concerned with the gradient-driven minimization of the differences between the provided proximity values and those computed on a basis of the partition matrix computed at the first phase of the algorithm. The proximity type of auxiliary information is discussed in the context of Web mining where clusters of Web pages are built in presence of some proximity information provided by a user who assesses (assigns) these degrees on a basis of some personal preferences. Numeric studies involve experiments with several synthetic data and Web data (pages).


68T05 Learning and adaptive systems in artificial intelligence
68T37 Reasoning under uncertainty in the context of artificial intelligence


Full Text: DOI


[1] Baeza-Yates, R.; Ribeiro-Neto, R.B., Modern information retrieval, (1999), Addison-Wesley Reading, MA
[2] Bargiela, A.; Pedrycz, W., Granular computing: an introduction, (2002), Kluwer Academic Publishers Dordrecht
[3] Bezdek, J.C., Pattern recognition and fuzzy objective function algorithms, (1981), Plenum Press New York · Zbl 0503.68069
[4] Boley, D., Partitioning-based clustering for web document categorization, Decision support systems, 27, 329-341, (1999)
[5] Broder, A.Z.; Glassman, S.C.; Manasse, M.S.; Zweig, G., Syntactic clustering of the web, Comput. networks ISDN systems, 29, 1157-1166, (1997)
[6] J. Furnkranz, Exploiting structural information for text classification on the WWW, Proc. 3rd Internat. Symp. Advances in Intelligent Data Analysis, 1999, pp. 487-498.
[7] Guillaume, D.; Murtargh, F., Clustering of XML documents, Comput. phys. comm, 127, 215-227, (2000) · Zbl 0961.68524
[8] Hathaway, R.J.; Bezdek, J.C., NERF-c meansnon-Euclidean relational fuzzy clustering, Pattern recognition, 27, 429-437, (1994)
[9] Hathaway, R.J.; Bezdek, J.C.; Davenport, J.W., On relational data versions of c-means algorithms, Pattern recognition lett, 17, 607-612, (1996)
[10] Hathaway, R.J.; Bezdek, J.C.; Hu, Y., Generalized fuzzy C-means clustering strategies using Lp norm distances, IEEE trans. fuzzy systems, 8, 5, 576-582, (2000)
[11] Hathaway, R.J.; Davenport, J.W.; Bezdek, J.C., Relational dual of the C-means clustering algorithms, Pattern recognition, 22, 2, 205-212, (1989) · Zbl 0673.62050
[12] Hoppner, F., Fuzzy shell clustering in image processing—fuzzy c-rectangular and two rectangular shells, IEEE trans. fuzzy systems, 5, 5, 599-613, (1997)
[13] Hoppner, F.; Klawonn, F.; Kruse, R.; Runkler, T., Fuzzy cluster analysis—methods for image recognition, (1999), Wiley New York · Zbl 0944.65009
[14] Krishnapuram, R.; Joshi, A.; Nasroui, O.; Yi, L., Low-complexity fuzzy relational clustering algorithms for web mining, IEEE trans on fuzzy systems, 9, 4, 595-607, (2001)
[15] Lazzerini, B.; Marcelloni, F., Classification based on neural similarity, Electron. lett, 38, 15, 810-812, (2002)
[16] Li, W.S.; Agrawal, D., Supporting web query expansion efficiently using multi-granularity indexing and query processing, Data knowledge eng, 35, 239-257, (2000) · Zbl 0948.68066
[17] Loh, S.; Wives, L.K.; Palazzo, J., Concept based knowledge discovery from texts extracted from the web, ACM SIGKDD explorations, 2, 1, 29-40, (2000)
[18] Mitra, S.; Pal, S.K.; Mitra, P., Data mining in soft computing frameworka survey, IEEE trans. neural networks, 13, 1, 3-14, (2002)
[19] Miyamoto, S., Information clustering based on fuzzy multisets, Inform. process. and management, 39, 2, 195-213, (2003) · Zbl 1056.68080
[20] W. Pedrycz, G. Succi, M. Reformat, P. Musilek, X. Bai, Expressing similarity in software engineering: a neural model, Proc. 2nd Internat. Workshop on Soft Computing Applied to Software Engineering, Enschede, the Netherlands, February, 2001.
[21] Rousinov, D.; Zhao, J.L., Automatic discovery of similarity relationships through web mining, Decision support systems, 35, 1, 149-166, (2003)
[22] Runkler, T.A.; Bezdek, J.C., Alternating cluster estimationa new tool for clustering and function approximation, IEEE trans. fuzzy systems, 7, 4, 377-393, (1999)
[23] Runkler, T.A.; Bezdek, J.C., Web mining with relational clustering, Internat. J. approx. reason, 32, 217-236, (2003) · Zbl 1026.68006
[24] Ruspini, E., A new approach to clustering, Inform. and control, 15, 1, 22-32, (1969) · Zbl 0192.57101
[25] Smith, K.A.; Ng, A., Web clustering using a self-organizing map of user navigation patterns, Decision support systems, 35, 2, 245-256, (2003)
[26] Walker, R.L., Search engine case study: searching the web using genetic programming and MPI, Parallel computing, 27, 71-89, (2001) · Zbl 0971.68005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.