An Efficient Parallel and Distributed Algorithm on Top of MapReduce
The undertaking of subspace bunching is for discover concealed groups present in various subspaces inside of dataset. Lately, through the accumulate development of information extent as well as information measurements, conventional subspace grouping calculations convert wasteful just as ineffectual...
Uloženo v:
| Vydáno v: | International journal of innovative technology and exploring engineering Ročník 8; číslo 10; s. 908 - 911 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
30.08.2019
|
| ISSN: | 2278-3075, 2278-3075 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The undertaking of subspace bunching is for discover concealed groups present in various subspaces inside of dataset. Lately, through the accumulate development of information extent as well as information measurements, conventional subspace grouping calculations convert wasteful just as ineffectual whereas extricating learning in the huge information condition, bringing about a rising need to structure productive parallel circulated subspace bunching calculations to deal with huge multi- dimensional information by an adequate calculus expense. This article provides MapReduce-dependent calculation of a parallel mafia subspace bunching. The calculation exploits MapReduce's information apportioning in addition undertaking parallelism and accomplishes decent tradeoff amongst the expense for plate gets to besides correspondence fare. The exploratory results indicate near immediate accelerations and demonstrate the elevated adaptability and incredible opportunities for implementation of the suggested calculation. |
|---|---|
| AbstractList | The undertaking of subspace bunching is for discover concealed groups present in various subspaces inside of dataset. Lately, through the accumulate development of information extent as well as information measurements, conventional subspace grouping calculations convert wasteful just as ineffectual whereas extricating learning in the huge information condition, bringing about a rising need to structure productive parallel circulated subspace bunching calculations to deal with huge multi- dimensional information by an adequate calculus expense. This article provides MapReduce-dependent calculation of a parallel mafia subspace bunching. The calculation exploits MapReduce's information apportioning in addition undertaking parallelism and accomplishes decent tradeoff amongst the expense for plate gets to besides correspondence fare. The exploratory results indicate near immediate accelerations and demonstrate the elevated adaptability and incredible opportunities for implementation of the suggested calculation. |
| Author | Krishna, I. Rama Reddy, G. Venkata Rami Karuna, G. |
| Author_xml | – sequence: 1 givenname: G. surname: Karuna fullname: Karuna, G. – sequence: 2 givenname: I. Rama surname: Krishna fullname: Krishna, I. Rama – sequence: 3 givenname: G. Venkata Rami surname: Reddy fullname: Reddy, G. Venkata Rami |
| BookMark | eNpN0E1OwzAUBGALFYlSegQkXyDhOY4TexmF8qciECpry9jP4CqNIyddcHuqtgtWM5rFLL5rMutjj4TcMsi5UCXchW2YEPMXBbXIQUoGTF2QeVHUMuOHbfavX5HlOG4BgPGSyUrNSdv0dOV9sAH7ib6bZLoOO2p6R-_DOKXwtZ_Q0ab7jilMPzsae7qJA42evprhA93e4g259KYbcXnOBfl8WG3ap2z99vjcNuvMsoqrzENhlUVm0RXmsJTW1ch9ZaStHa8EssKhBKM4gGASkYnaSQWVd4KDZ3xBxOnXpjiOCb0eUtiZ9KsZ6COGPmHoI4Y-Y_A_UPZVXg |
| ContentType | Journal Article |
| CorporateAuthor | School of Information Technology, JNTUH, Hyderabad, India Computer Science and Engineering, GRIET, Hyderabad, India School of Information Technology, JNTUH, Hyderabad India |
| CorporateAuthor_xml | – name: Computer Science and Engineering, GRIET, Hyderabad, India – name: School of Information Technology, JNTUH, Hyderabad India – name: School of Information Technology, JNTUH, Hyderabad, India |
| DBID | AAYXX CITATION |
| DOI | 10.35940/ijitee.J9075.0881019 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2278-3075 |
| EndPage | 911 |
| ExternalDocumentID | 10_35940_ijitee_J9075_0881019 |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION M~E OK1 RNS |
| ID | FETCH-LOGICAL-c1639-f02c9ce1ced2a1634cd7e3f6a8c7d365e12de80a9300518ee157d8906fd530f13 |
| ISSN | 2278-3075 |
| IngestDate | Sat Nov 29 06:26:28 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 10 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1639-f02c9ce1ced2a1634cd7e3f6a8c7d365e12de80a9300518ee157d8906fd530f13 |
| OpenAccessLink | https://doi.org/10.35940/ijitee.j9075.0881019 |
| PageCount | 4 |
| ParticipantIDs | crossref_primary_10_35940_ijitee_J9075_0881019 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-08-30 |
| PublicationDateYYYYMMDD | 2019-08-30 |
| PublicationDate_xml | – month: 08 year: 2019 text: 2019-08-30 day: 30 |
| PublicationDecade | 2010 |
| PublicationTitle | International journal of innovative technology and exploring engineering |
| PublicationYear | 2019 |
| SSID | ssj0001341869 |
| Score | 2.0775511 |
| Snippet | The undertaking of subspace bunching is for discover concealed groups present in various subspaces inside of dataset. Lately, through the accumulate... |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 908 |
| Title | An Efficient Parallel and Distributed Algorithm on Top of MapReduce |
| Volume | 8 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2278-3075 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001341869 issn: 2278-3075 databaseCode: M~E dateStart: 20120101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwoEeEE9RXvKB2yrBeW3s46pAAYkKVQvqLXLtCQ2UZBXSVU_8J_4hY3vj9VYVogcu0WqyO_FmRjPj8cx8hLwEM7RMK4jKEwFRnjEWiRpEpASTJ7qcyYRLCzZRHh7y42PxaTL5PfbCrM7KtuUXF2L5X0WNNBS2aZ29hrg9UyTgZxQ6XlHseP0nwc9bA5fc2EZHDBB7A5bi5gG8NkNyDb4VBpnzs69d3wynP8xpwaJbulKY5ZGZ5LpVHbSdMtwaNOHwVFcwHXx-3j4HfF0fbKYdessu-3PXh3YQe5qBuXfE9_H0SG58Ba7HeYGDePoF2u9ykOZ-EyYrTH8UH89drE0zjbcm3eUOsuEK2too81D3WGBhBeOBsxbOUl_2A1khclM52XzDuB3iDwK5x2hP0f6IjeMbD_sv-UNfpYj7I8uocmwqy6Zas7lBbqa41zJoIR9_BWk9jAq4BVL0f8v1jVlOr65aUBARBaHN4i65s96T0LnTpXtkAu19shtMqnxA9uct9VpFR62iKG0aaBX1WkW7lqJW0a6mXqseks9v3yz230Vr_I1IYZQuopqlSihIFOhUIiVXuoSsnkmuSp3NCkhSDZxJYSAPEg6QFKXmgs1qXWSsTrJHZKftWnhMaF5L3IjkinMFuU4Zl2j5E53il2RdlsUeicd3UC3dmJXqr6__yXV_8JTc3ijkM7Iz9OfwnNxSq6H52b-wQvwDmB94Gw |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Efficient+Parallel+and+Distributed+Algorithm+on+Top+of+MapReduce&rft.jtitle=International+journal+of+innovative+technology+and+exploring+engineering&rft.au=Karuna%2C+G.&rft.au=Krishna%2C+I.+Rama&rft.au=Reddy%2C+G.+Venkata+Rami&rft.date=2019-08-30&rft.issn=2278-3075&rft.eissn=2278-3075&rft.volume=8&rft.issue=10&rft.spage=908&rft.epage=911&rft_id=info:doi/10.35940%2Fijitee.J9075.0881019&rft.externalDBID=n%2Fa&rft.externalDocID=10_35940_ijitee_J9075_0881019 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2278-3075&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2278-3075&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2278-3075&client=summon |