User Profile Tracking by Web Usage Mining in Cloud Computing
Saved in:
| Title: | User Profile Tracking by Web Usage Mining in Cloud Computing |
|---|---|
| Authors: | John, Joan M., Mini, G. Venifa, Arun, E. |
| Source: | Procedia Engineering. Sep2012, Vol. 38, p3270-3277. 8p. |
| Subjects: | Web analytics, Cloud computing, Information sharing, Internet content, Scalability, Databases, Distributed computing, Algorithms |
| Abstract: | Abstract: Service oriented domain like cloud computing, composite service selection is hard to accomplish in an effective manner. The high scalability of distributed systems, and large transaction of data bases, it is a vital important to categorizes the efficient methods for distributed mining. Researcher on web has given a great attention to web usage mining which is an evolution of internet to evaluate user profiles and knowledge sharing of web content. This paper discloses the efficient relationship between the local and global transaction data items. It extracts valuable information from the large amount of data available in the user web sessions. To segment the data, the distance between the two user sessions is measured with the help of similarity distance measures. Aim of this paper is to introduce a technique called registry federation mechanism to meet the associated business requirements and it also describes a distributed algorithm for sequential mining within registry federation. [Copyright &y& Elsevier] |
| Copyright of Procedia Engineering is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 79877576 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: User Profile Tracking by Web Usage Mining in Cloud Computing – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22John%2C+Joan+M%2E%22">John, Joan M.</searchLink><br /><searchLink fieldCode="AR" term="%22Mini%2C+G%2E+Venifa%22">Mini, G. Venifa</searchLink><br /><searchLink fieldCode="AR" term="%22Arun%2C+E%2E%22">Arun, E.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Procedia+Engineering%22">Procedia Engineering</searchLink>. Sep2012, Vol. 38, p3270-3277. 8p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Web+analytics%22">Web analytics</searchLink><br /><searchLink fieldCode="DE" term="%22Cloud+computing%22">Cloud computing</searchLink><br /><searchLink fieldCode="DE" term="%22Information+sharing%22">Information sharing</searchLink><br /><searchLink fieldCode="DE" term="%22Internet+content%22">Internet content</searchLink><br /><searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Abstract: Service oriented domain like cloud computing, composite service selection is hard to accomplish in an effective manner. The high scalability of distributed systems, and large transaction of data bases, it is a vital important to categorizes the efficient methods for distributed mining. Researcher on web has given a great attention to web usage mining which is an evolution of internet to evaluate user profiles and knowledge sharing of web content. This paper discloses the efficient relationship between the local and global transaction data items. It extracts valuable information from the large amount of data available in the user web sessions. To segment the data, the distance between the two user sessions is measured with the help of similarity distance measures. Aim of this paper is to introduce a technique called registry federation mechanism to meet the associated business requirements and it also describes a distributed algorithm for sequential mining within registry federation. [Copyright &y& Elsevier] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Procedia Engineering is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=79877576 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.proeng.2012.06.378 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 8 StartPage: 3270 Subjects: – SubjectFull: Web analytics Type: general – SubjectFull: Cloud computing Type: general – SubjectFull: Information sharing Type: general – SubjectFull: Internet content Type: general – SubjectFull: Scalability Type: general – SubjectFull: Databases Type: general – SubjectFull: Distributed computing Type: general – SubjectFull: Algorithms Type: general Titles: – TitleFull: User Profile Tracking by Web Usage Mining in Cloud Computing Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: John, Joan M. – PersonEntity: Name: NameFull: Mini, G. Venifa – PersonEntity: Name: NameFull: Arun, E. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2012 Type: published Y: 2012 Identifiers: – Type: issn-print Value: 18777058 Numbering: – Type: volume Value: 38 Titles: – TitleFull: Procedia Engineering Type: main |
| ResultId | 1 |