%0 Conference Paper %1 citeulike:341236 %A Domingos, Pedro %A Richardson, Matt %B KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining %C New York, NY, USA %D 2001 %I ACM Press %K socialnets %P 57--66 %R 10.1145/502512.502525 %T Mining the network value of customers %U http://dx.doi.org/10.1145/502512.502525 %@ 158113391X

@inproceedings{citeulike:341236, added-at = {2006-06-16T10:34:37.000+0200}, address = {New York, NY, USA}, author = {Domingos, Pedro and Richardson, Matt}, biburl = {https://www.bibsonomy.org/bibtex/22f5357d0254170095f35bdec064b2c52/ldietz}, booktitle = {KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining}, citeulike-article-id = {341236}, comment = {Paper of Hofmann's Seminar --- Given Network, find most valuable persons (instrinsic value + network value) Method: Markov Random Field --- How can I use the results? Gegeben M, kann aus (5) der expected lift in profit berechnet werden. Mit einer der Strategien "single pass", "greedy search" oder "hill-climbing" kann der ELP maximiert werden. Um den ELP zu berechnen braucht man nach (2) verschiedene bedingte Ws'keiten. Insbesondere P(Xi|Ni). Dazu kann z.B. die empfehlungen ähnlicher Benutzer in Collab FIltering verwendet werden, wie in (8)}, doi = {10.1145/502512.502525}, interhash = {06c61e380328a3288b56699294f8066a}, intrahash = {2f5357d0254170095f35bdec064b2c52}, isbn = {158113391X}, keywords = {socialnets}, pages = {57--66}, priority = {0}, publisher = {ACM Press}, timestamp = {2006-06-16T10:34:37.000+0200}, title = {Mining the network value of customers}, url = {http://dx.doi.org/10.1145/502512.502525}, year = 2001 }