Fuzzy Clustering in Web Mining

Web mining is the use of data mining techniques to automatically discover and extract information from web. Clustering is one of the possible techniques to improve the efficiency in information finding process. Conventional clustering classifies the given data objects into exclusive clusters. However such a partition is insufficient to represent many real situations. Hence a fuzzy clustering method is offered to construct clusters with uncertain boundaries and allows the object to belong to multiple clusters with degree of membership. Web data has fuzzy characteristics, so fuzzy clustering is better suitable for web mining in comparison with conventional clustering. In this paper, we have proposed two algorithms that are Fuzzy c-Means (FCM) and Clustering based on Fuzzy Equivalence Relations which can be used for web page mining and web usage mining. The results obtained from the proposed algorithm are more convincing. The experimental results are carried out on different algorithmic parameters on real data. The analysis is being done by comparing the proposed algorithm with conventional clustering algorithms

Soft clustering: An overview

Document clustering has been extensively investigated as a methodology for improving document retrieval process. In Traditional clustering algorithm each documents belongs to exactly one cluster & hence cannot detect the multiple themes of a document where as soft clustering algorithm each document can belong to multiple clusters. This paper gives a comparative study of hard clustering & soft clustering algorithm

A Review: Data Mining Technique Used for Searching the Keywords

Convential Spatial queries contains range search, nearest neighbor retrival involve only conditions on object geometric properties. Today, many modern applications call for innovative kind of queries that aim to find objects satisfying both a spatial predicate, and a predicate on their associated texts. For example, instead of considering all the restaurants, a nearest neighbor query would instead ask for the restaurant that is the closest among those whose menus contain “Dosa, Idli, Wadapav” all at the same time. Currently the best solution to such queries is based on the IR2-tree, which, such type of queries can be efficiently handled by IR2tree. In the proposed work, we are developing a system searching is done on the basis of methods like nearest neighbor search with keywords is done by IR2 tree and spatial inverted index.We could first fetch all the restaurants whose menus contain the set of keywords {Dosa, Idli, Wadapav}, and then from the retrieved restaurants, find the nearest one The IR2-tree combines the R tree with signature files. Inverted indexes (I-index) have proved to be an effective access method for keyword based document retrieval

Implementation of Congestion Awareness and Adaptivity in Mobile Ad Hoc Networks

Congestion in mobile ad hoc networks leads to transmission delays and packet losses and causes wastage of time and energy on recovery. In the current designs, routing is not congestion adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. Routing should not only be aware of, but also be adaptive to, network congestion. Routing protocols which are adaptive to the congestion status of a mobile ad hoc network can greatly improve the network performance. Many protocols which are congestion aware and congestion adaptive have been proposed. In this paper, we present a survey of congestion adaptive routing protocols for mobile ad hoc networks. Ad hoc networks consist of independent self-structured nodes. Nodes utilize a wireless medium for exchange their message or data, as a result two nodes can converse in a straight one to one connection if and only if they are within every other?s transmit range

Bianchijev kozmološki model tipa I u Lyrinoj mnogostrukosti

Bianchi type-I cosmological model in Lyra\u27s manifold is obtained assuming a massless scalar field as the source of gravitational field. Some physical and geometrical properties of the model are discussed.Razvili smo Bianchijev kozmološki model tipa I u Lyrinoj mnogostrukosti kada je izvor gravitacijskog polja bezmaseno skalarno polje. Raspravljaju se neka fizička i geometrijska svojstva modela

Compaction of microporous amorphous solid water by ion irradiation

We have studied the compaction of vapor-deposited amorphous solid water by energetic ions at 40 K. The porosity was characterized by ultraviolet-visible spectroscopy, infrared spectroscopy, and methane adsorption/desorption. These three techniques provide different and complementary views of the structural changes in ice resulting from irradiation. We find that the decrease in internal surface area of the pores, signaled by infrared absorption by dangling bonds, precedes the decrease in the pore volume during irradiation. Our results imply that impacts from cosmic rays can cause compaction in the icy mantles of the interstellar grains, which can explain the absence of dangling bond features in the infrared spectrum of molecular clouds.Fil: Raut, U.. University of Virginia; Estados UnidosFil: Teolis, B. D.. University of Virginia; Estados UnidosFil: Loeffler, M. J.. University of Virginia; Estados UnidosFil: Vidal, Ricardo Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: Famá, M.. University of Virginia; Estados UnidosFil: Baragiola, R. A.. University of Virginia; Estados Unido