| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Ahn, Y., Han, S., Kwak, H., Moon, S. & Jeong, H. | Analysis of topological characteristics of huge online social networking services [BibTeX] |
2007 | Proceedings of the 16th international conference on World Wide Web | inproceedings | DOIURL |
BibTeX:
@inproceedings{ahn2007topological,
author = {Yong-Yeol Ahn and Seungyeop Han and Haewoon Kwak and Sue Moon and Hawoong Jeong},
title = {Analysis of topological characteristics of huge online social networking services},
booktitle = {Proceedings of the 16th international conference on World Wide Web},
publisher = {ACM},
year = {2007},
pages = {835--844},
url = {http://portal.acm.org/citation.cfm?id=1242685},
doi = {http://doi.acm.org/10.1145/1242572.1242685}
}
|
|||||
| Astrachan, O. | Bubble sort: an archaeological algorithmic analysis | 2003 | SIGCSE Bull. | article | DOIURL |
| Abstract: Text books, including books for general audiences, invariably mention bubble sort in discussions of elementary sorting algorithms. We trace the history of bubble sort, its popularity, and its endurance in the face of pedagogical assertions that code and algorithmic examples used in early courses should be of high quality and adhere to established best practices. This paper is more an historical analysis than a philosophical treatise for the exclusion of bubble sort from books and courses. However, sentiments for exclusion are supported by Knuth [17], "In short, the bubble sort seems to have nothing to recommend it, except a catchy name and the fact that it leads to some interesting theoretical problems." Although bubble sort may not be a best practice sort, perhaps the weight of history is more than enough to compensate and provide for its longevity. | |||||
BibTeX:
@article{611918,
author = {Owen Astrachan},
title = {Bubble sort: an archaeological algorithmic analysis},
journal = {SIGCSE Bull.},
publisher = {ACM},
year = {2003},
volume = {35},
number = {1},
pages = {1--5},
url = {http://portal.acm.org/citation.cfm?id=611918&dl=GUIDE,},
doi = {http://doi.acm.org/10.1145/792548.611918}
}
|
|||||
| Goossens, M., Mittelbach, F. & Samarin, A. | Der Begleiter [BibTeX] |
1994 | book | ||
BibTeX:
@book{Goossens2000dlb,
author = {Michel Goossens and Frank Mittelbach and Alexander Samarin},
title = {Der \LaTeX-Begleiter},
publisher = {Addison-Wesley},
year = {1994}
}
|
|||||
| Java, A., Joshi, A. & Finin, T. | Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies [BibTeX] |
2008 | WebKDD 2008 Workshop on Web Mining and Web Usage Analysis | inproceedings | |
BibTeX:
@inproceedings{Detecting_Commmunities_via_Simultaneous_Clustering_of_Graphs_and_Folksonomies,
author = {Akshay Java and Anupam Joshi and Tim Finin},
title = {Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies},
booktitle = {WebKDD 2008 Workshop on Web Mining and Web Usage Analysis},
year = {2008},
note = {To Appear}
}
|
|||||
| Jäschke, R., Hotho, A., Schmitz, C., Ganter, B. & Stumme, G. | TRIAS - An Algorithm for Mining Iceberg Tri-Lattices | 2006 | ICDM '06: Proceedings of the Sixth International Conference on Data Mining | inproceedings | DOIURL |
| Abstract: In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folk-sonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution as well as experimental results on a large real-world example. | |||||
BibTeX:
@inproceedings{jaeschke2006trias,
author = {Robert Jäschke and Andreas Hotho and Christoph Schmitz and Bernhard Ganter and Gerd Stumme},
title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
booktitle = {ICDM '06: Proceedings of the Sixth International Conference on Data Mining},
publisher = {IEEE Computer Society},
year = {2006},
pages = {907--911},
url = {http://portal.acm.org/citation.cfm?id=1193256},
doi = {http://dx.doi.org/10.1109/ICDM.2006.162}
}
|
|||||
| Jäschke, R., Krause, B., Hotho, A. & Stumme, G. | Logsonomy — A Search Engine Folksonomy | 2008 | Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008) | inproceedings | URL |
| Abstract: In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us. | |||||
BibTeX:
@inproceedings{Jaeschke2008logsonomy,
author = {Robert Jäschke and Beate Krause and Andreas Hotho and Gerd Stumme},
title = {Logsonomy — A Search Engine Folksonomy},
booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)},
publisher = {AAAI Press},
year = {2008},
url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2008/Krause2008logsonomy_short.pdf}
}
|
|||||
| Kopka, H. | Eine Einführung [BibTeX] |
1992 | book | ||
BibTeX:
@book{kopka:1988,
author = {Helmut Kopka},
title = {\LaTeX: Eine Einführung},
publisher = {Addison-Wesley},
year = {1992}
}
|
|||||
| Krause, B., Jäschke, R., Hotho, A. & Stumme, G. | Logsonomy - Social Information Retrieval with Logdata | 2008 | HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia | inproceedings | DOIURL |
| Abstract: Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics. | |||||
BibTeX:
@inproceedings{krause2008logsonomy,
author = {Beate Krause and Robert Jäschke and Andreas Hotho and Gerd Stumme},
title = {Logsonomy - Social Information Retrieval with Logdata},
booktitle = {HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia},
publisher = {ACM},
year = {2008},
pages = {157--166},
url = {http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia},
doi = {http://doi.acm.org/10.1145/1379092.1379123}
}
|
|||||
| Lucchese, C., Orlando, S. & Perego, R. | Fast and Memory Efficient Mining of Frequent Closed Itemsets [BibTeX] |
2006 | IEEE Transactions On Knowledge and Data Engineering | article | |
BibTeX:
@article{tkde06,
author = {Claudio Lucchese and Salvatore Orlando and Raffaele Perego},
title = {Fast and Memory Efficient Mining of Frequent Closed Itemsets},
journal = {IEEE Transactions On Knowledge and Data Engineering},
year = {2006},
volume = {18},
number = {1},
pages = {21--36}
}
|
|||||
| Orlando, S., Palmerini, P., Perego, R. & Silvestri, F. | An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets | 2003 | High Performance Computing for Computational Science — VECPAR 2002 | inproceedings | URL |
| Abstract: Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, whichin many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm forcounting the occurrences of frequent sets within transactional databases. ParDCI is a parallel version of DCI (Direct Count& Intersect), a multi-strategy algorithm which is able to adapt its behavior not only to the features of the specific computingplatform (e.g. available memory), but also to the features of the dataset being processed (e.g. sparse or dense datasets).ParDCI enhances previous proposals by exploiting the highly optimized counting and intersection techniques of DCI, and byrelying on a multi-level parallelization approachwh ichex plicitly targets clusters of SMPs, an emerging computing platform.We focused our work on the efficient exploitation of the underlying architecture. Intra-Node multithreading effectively exploitsthe memory hierarchies of each SMP node, while Inter-Node parallelism exploits smart partitioning techniques aimed at reducingcommunication overheads. In depth experimental evaluations demonstrate that ParDCI reaches nearly optimal performances undera variety of conditions. | |||||
BibTeX:
@inproceedings{orlando02efficient,
author = {Salvatore Orlando and Paolo Palmerini and Raffaele Perego and Fabrizio Silvestri},
title = {An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets},
booktitle = {High Performance Computing for Computational Science — VECPAR 2002},
year = {2003},
pages = {3--29},
url = {http://dx.doi.org/10.1007/3-540-36569-9_28}
}
|
|||||
Created by JabRef export filters on 20/07/2008 by the social publication management platform BibSonomy